68 search results - page 1 / 14 » Multiple Genome Alignment: Chaining Algorithms Revisited |
CPM
2003
Springer
14 years 4 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
RECOMB
2004
Springer
14 years 11 months ago
2004
Springer
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...
WABI
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In this paper we propose a chaining method that can align a draft genomic sequence against a finished genome. We introduce the use of an overlap tree to enhance the state...
BMCBI
2005
13 years 10 months ago
2005
Background: Genomic sequence data cannot be fully appreciated in isolation. Comparative genomics
RECOMB
2010
Springer
13 years 8 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...