Sciweavers

44 search results - page 9 / 9
» On the Repeat-Annotated Phylogenetic Tree Reconstruction Pro...
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 10 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
117views more  BMCBI 2010»
13 years 10 months ago
Using jackknife to assess the quality of gene order phylogenies
Background: In recent years, gene order data has attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. If ge...
Jian Shi, Yiwei Zhang, Haiwei Luo, Jijun Tang
RECOMB
2007
Springer
14 years 10 months ago
Improving Inversion Median Computation Using Commuting Reversals and Cycle Information
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
William Arndt, Jijun Tang
BMCBI
2008
96views more  BMCBI 2008»
13 years 10 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown