Sciweavers

85 search results - page 1 / 17
» Multiple Genome Alignment by Clustering Pairwise Matches
Sort
View
RECOMB
2004
Springer
14 years 4 months ago
Multiple Genome Alignment by Clustering Pairwise Matches
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...
Jeong-Hyeon Choi, Kwangmin Choi, Hwan-Gue Cho, Sun...
BMCBI
2008
116views more  BMCBI 2008»
13 years 4 months ago
Clustering exact matches of pairwise sequence alignments by weighted linear regression
Background: At intermediate stages of genome assembly projects, when a number of contigs have been generated and their validity needs to be verified, it is desirable to align thes...
Alvaro J. González, Li Liao
BMCBI
2011
12 years 11 months ago
Screening synteny blocks in pairwise genome comparisons through integer programming
Background: It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor...
Haibao Tang, Eric Lyons, Brent S. Pedersen, James ...
APBC
2004
13 years 6 months ago
EMAGEN: An Efficient Approach to Multiple Whole Genome Alignment
Following advances in biotechnology, many new whole genome sequences are becoming available every year. A lot of useful information can be derived from the alignment and compariso...
Jitender S. Deogun, Jingyi Yang, Fangrui Ma
JCB
2008
122views more  JCB 2008»
13 years 4 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz