Sciweavers

959 search results - page 15 / 192
» Comparative genome assembly
Sort
View
JACM
2002
94views more  JACM 2002»
14 years 9 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
JCB
2008
144views more  JCB 2008»
14 years 9 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
CORR
2010
Springer
126views Education» more  CORR 2010»
14 years 7 months ago
Triangular Self-Assembly
We discuss the self-assembly system of triangular tiles instead of square tiles, in particular right triangular tiles and equilateral triangular tiles. We show that the triangular...
Lila Kari, Shinnosuke Seki, Zhi Xu
BMCBI
2007
106views more  BMCBI 2007»
14 years 9 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
15 years 3 months ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...