Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

CPM
2003
Springer

favoriteEmaildiscussreport

68views Combinatorics» more CPM 2003»

Multiple Genome Alignment: Chaining Algorithms Revisited

14 years 4 months ago

Multiple Genome Alignment: Chaining Algorithms Revisited

Download theorie.informatik.uni-ulm.de

Given n fragments from k > 2 genomes, we will show how to ﬁnd 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). Our result solves an open problem posed by Myers and Miller because it reduces the time complexity of their algorithm by a factor log2 n log log n and the space complexity by a factor log n. For k = 2 genomes, our algorithm takes O(n log n) time and O(n) space.

Mohamed Ibrahim Abouelhoda, Enno Ohlebusch

Real-time Traffic

Colinear Non-overlapping Fragments | CPM 2003 | Factor Log | Optimal Chain |

claim paper

Related Content

» Multiple Genome Alignment by Clustering Pairwise Matches

» Chaining Algorithms for Alignment of Draft Sequence

» Genomic multiple sequence alignments refinement using a genetic algorithm

» Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps

» Parameters for accurate genome alignment

» Improving pangenome annotation using whole genome multiple alignment

» A Prototype for Multiple Whole Genome Alignment

» Automatic extraction of reliable regions from multiple sequence alignments

» Kalign an accurate and fast multiple sequence alignment algorithm

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CPM
Authors	Mohamed Ibrahim Abouelhoda, Enno Ohlebusch

Comments (0)