Sciweavers

8 search results - page 1 / 2
» Comparing Assemblies Using Fragments and Mate-Pairs
Sort
View
WABI
2001
Springer
134views Bioinformatics» more  WABI 2001»
13 years 9 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...
CAINE
2008
13 years 6 months ago
Parallel Assembler for Fuzzy Genome Sequence Assembly
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...
Sara Nasser, Adrienne Breland, Frederick C. Harris...
BMCBI
2007
104views more  BMCBI 2007»
13 years 4 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
BCB
2010
156views Bioinformatics» more  BCB 2010»
12 years 12 months ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
BMCBI
2010
154views more  BMCBI 2010»
13 years 5 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...