Sciweavers

49 search results - page 3 / 10
» Stability of Rearrangement Measures in the Comparison of Gen...
Sort
View
JCB
2007
146views more  JCB 2007»
13 years 5 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
BMCBI
2008
125views more  BMCBI 2008»
13 years 5 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
ALMOB
2008
131views more  ALMOB 2008»
13 years 5 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
BMCBI
2010
100views more  BMCBI 2010»
13 years 5 months ago
Scaffold filling, contig fusion and comparative gene order inference
Background: There has been a trend in increasing the phylogenetic scope of genome sequencing without finishing the sequence of the genome. Increasing numbers of genomes are being ...
Adriana Muñoz, Chunfang Zheng, Qian Zhu, Vi...
BMCBI
2010
126views more  BMCBI 2010»
13 years 5 months ago
Cgaln: fast and space-efficient whole-genome alignment
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
Ryuichiro Nakato, Osamu Gotoh