title: De novo repeat classification and fragment assembly.
abstract: Repetitive sequences make up a significant fraction of almost any genome, and an important and still open question in bioinformatics is how to represent all repeats in DNA sequences. We propose a new approach to repeat classification that represents all repeats in a genome as a mosaic of sub-repeats. Our key algorithmic idea also leads to new approaches to multiple alignment and fragment assembly. In particular, we show that our FragmentGluer assembler improves on Phrap and ARACHNE in assembly of BACs and bacterial genomes.
authors.affiliation: Department of Computer Science and Engineering, University of California, San Diego, La Jolla, California 92093, USA.
authors.forename: Pavel A
authors.initials: PA
authors.lastname: Pevzner
authors.forename: Paul A
authors.initials: PA
authors.lastname: Pevzner
authors.forename: Haixu
authors.initials: H
authors.lastname: Tang
authors.forename: Glenn
authors.initials: G
authors.lastname: Tesler
mesh_terms: D000465:Algorithms; D022202:Chromosomes, Artificial, Bacterial; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods / Q000706:statistics & numerical data; D020451:Contig Mapping / Q000379:methods*; D008040:Genetic Linkage / Q000235:genetics; D015894:Genome, Human; D006801:Humans; D005810:Multigene Family / Q000235:genetics*; D012091:Repetitive Sequences, Nucleic Acid / Q000235:genetics*; D016415:Sequence Alignment / Q000379:methods / Q000706:statistics & numerical data