Sciweavers

613 search results - page 54 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 10 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
ICCS
2005
Springer
14 years 4 months ago
Phylogenetic Networks, Trees, and Clusters
Phylogenetic networks model evolutionary histories in the presence of non-treelike events such as hybrid speciation and horizontal gene transfer. In spite of their widely acknowled...
Luay Nakhleh, Li-San Wang
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
14 years 2 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
COLING
1996
14 years 5 days ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
14 years 4 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...