Sciweavers

193 search results - page 8 / 39
» Approximate Maximum Parsimony and Ancestral Maximum Likeliho...
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
14 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
CORR
2006
Springer
102views Education» more  CORR 2006»
14 years 10 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar
JCB
2008
71views more  JCB 2008»
14 years 10 months ago
Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm
Quartet-based phylogeny reconstruction methods, such as Quartet Puzzling, were introduced in the hope that they might be competitive with maximum likelihood methods, without being...
Sagi Snir, Tandy Warnow, Satish Rao
BIBE
2005
IEEE
15 years 4 months ago
Improved Phylogenetic Motif Detection Using Parsimony
We have recently demonstrated (La et al, Proteins, 58:2005) that sequence fragments approximating the overall familial phylogeny, called phylogenetic motifs (PMs), represent a pro...
Usman Roshan, Dennis R. Livesay, David La
ACL
2010
14 years 8 months ago
Viterbi Training for PCFGs: Hardness Results and Competitiveness of Uniform Initialization
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
Shay B. Cohen, Noah A. Smith