Sciweavers

14 search results - page 2 / 3
» Recent Progress in Phylogenetic Combinatorics
Sort
View
BMCBI
2008
125views more  BMCBI 2008»
13 years 10 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...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
14 years 1 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
DAM
2007
153views more  DAM 2007»
13 years 9 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
COCOON
2006
Springer
14 years 1 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
NAR
2000
182views more  NAR 2000»
13 years 9 months ago
tmRDB (tmRNA database)
Maintained at the University of Texas Health Science Center at Tyler, Texas, the tmRNA database (tmRDB) is accessible at the URL http://psyche.uthct.edu/dbs/ tmRDB/tmRDB.html with...
Christian Zwieb, Jacek Wower