Sciweavers

22 search results - page 2 / 5
» A Comparison of DNA Fragment Assembly Algorithms
Sort
View
WABI
2001
Springer
134views Bioinformatics» more  WABI 2001»
13 years 11 months ago
Comparing Assemblies Using Fragments and Mate-Pairs
Using current technology, large consecutive stretches of DNA (such as whole chromosomes) are usually assembled from short fragments obtained by shotgun sequencing, or from fragment...
Daniel H. Huson, Aaron L. Halpern, Zhongwu Lai, Eu...
BMCBI
2007
104views more  BMCBI 2007»
13 years 7 months ago
A response to Yu et al. "A forward-backward fragment assembling algorithm for the identification of genomic amplification and de
Background: Yu et al. (BMC Bioinformatics 2007,8: 145+) have recently compared the performance of several methods for the detection of genomic amplification and deletion breakpoin...
Oscar M. Rueda, Ramón Díaz-Uriarte
BMCBI
2010
154views more  BMCBI 2010»
13 years 7 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
BMCBI
2004
146views more  BMCBI 2004»
13 years 7 months ago
The InDeVal insertion/deletion evaluation tool: a program for finding target regions in DNA sequences and for aiding in sequence
Background: The program InDeVal was originally developed to help researchers find known regions of insertion/deletion activity (with the exception of isolated single-base indels) ...
Sierra D. Stoneberg Holt, Jason A. Holt
BMCBI
2008
220views more  BMCBI 2008»
13 years 7 months ago
Gene prediction in metagenomic fragments: A large scale machine learning approach
Background: Metagenomics is an approach to the characterization of microbial genomes via the direct isolation of genomic sequences from the environment without prior cultivation. ...
Katharina J. Hoff, Maike Tech, Thomas Lingner, Rol...