Sciweavers

735 search results - page 50 / 147
» A Mechanization of Phylogenetic Trees
Sort
View
88
Voted
STOC
1996
ACM
92views Algorithms» more  STOC 1996»
15 years 4 months ago
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
123
Voted
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 7 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
100
Voted
IPPS
2009
IEEE
15 years 7 months ago
Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA
Computing large multiple protein sequence alignments using progressive alignment tools such as ClustalW requires several hours on state-of-the-art workstations. ClustalW uses a th...
Yongchao Liu, Bertil Schmidt, Douglas L. Maskell
111
Voted
RECOMB
2007
Springer
16 years 1 months ago
Beyond Galled Trees - Decomposition and Computation of Galled Networks
Reticulate networks are a type of phylogenetic network that are used to represent reticulate evolution involving hybridization, horizontal gene transfer or recombination. The simpl...
Daniel H. Huson, Tobias H. Klöpper
95
Voted
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 2 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...