A structural EM algorithm for phylogenetic inference

Journal of Computational Biology

Volumn 9, Issue 2, 2002, Pages 331-353

  Friedman, Nir ^a   Ninio, Matan ^a   Pe'er, Itsik ^b   Pupko, Tal ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

Evolutionary tree; Expectation maximization; Inference; Maximum likelihood; Phylogeny; Simulated annealing; Structural EM

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; CONFERENCE PAPER; INTERMETHOD COMPARISON; MAXIMUM LIKELIHOOD METHOD; MOLECULAR EVOLUTION; PHYLOGENETIC TREE CONSTRUCTION METHOD; PRIORITY JOURNAL; PROTEIN ANALYSIS; SEQUENCE DATABASE; SIMULATION; STATISTICS; STRUCTURAL EXPECTATION MAXIMIZATION;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DNA; EVOLUTION, MOLECULAR; LIKELIHOOD FUNCTIONS; PHYLOGENY; SEQUENCE ANALYSIS, DNA;

EID: 0036110773     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/10665270252935494     Document Type: Article

References (41)

1. Discovering the structure of complex dynamic systems
2. A method for deducing branching sequences in phylogeny
3. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
4. Approximating discrete probability distributions with dependence trees
5. Computationally difficult parsimony problems in phylogenetic systematics
6. Maximum likelihood from incomplete data via the EM algorithm
7. Parsimonious phylogenetic trees in metric spaces and simulated annealing
8. Bootstrap methods: Another look at the jackknife
9. Data perturbation for escaping local maxima in learning
10. Evolutionary trees from DNA sequences: A maximum likelihood approach
11. Phylogenies from molecular sequences: Inference and reliability
12. Learning belief networks in the presence of missing values and hidden variables
13. A codon-based model of nucleotide substitution for protein coding DNA sequences
14. Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
15. Branch and bound algorithms to determine minimal evolutionary trees
16. Disk-covering, a fast-converging method for phylogenetic tree reconstruction
17. Solving large scale phylogenetic problems using DCM2
18. The rapid generation of mutation data matrices from protein sequences
19. Evolution of protein molecules
20. A simple model for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences
21. Optimization by simulated annealing
22. On the shortest spanning subtree of a graph and the traveling salesman problem
23. A genetic algorithm for maximum likelihood phylogeny inference using nucleotide sequence data
24. The parsimony ratchet, a new method for rapid parsimony analysis
25. FastDNAmL: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood
26. How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph
27. Quartet-based phylogenetic inference: Improvements and limits
28. Where do rodents fit? Evidence from the complete mitochondrial genome of Sciurus vulgaris
29. Multiple local maxima for likelihoods of phylogenetic trees: A simulation study
30. The neighbor-joining method: A new method for reconstructing phylogenetic trees
31. CLUSTALW: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice
32. Maximum likelihood estimation of phylogeny from DNA sequences when substitution rates differ over sites
33. Estimating the pattern of nucleotide substitution