Sciweavers

    RECOMB
    2000
    Springer
    219views Computational Biology» more  RECOMB 2000»

    A compression algorithm for DNA sequences and its applications in genome comparison

    13 years 8 months ago
    A compression algorithm for DNA sequences and its applications in genome comparison
    Download  www.cs.umd.edu
    We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for benchmark DNA sequences. Signi cantly better compression results show that the approximate repeats are one of the main hidden regularities in DNA sequences. We then describe a theory of measuring the relatedness between two DNA sequences. Using our algorithm, we present strong experimental support for this theory, and demonstrate its application in comparing genomes and constructing evolutionary trees.
    Xin Chen, Sam Kwong, Ming Li
    claim paper
    Related Content
    Added 25 Aug 2010
    Updated 25 Aug 2010
    Type Conference
    Year 2000
    Where RECOMB
    Authors Xin Chen, Sam Kwong, Ming Li
    Comments (0)
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.