Maximum-Likelihood Analysis Using TREE-PUZZLE
نویسندگان
چکیده
منابع مشابه
Maximum-likelihood analysis using TREE-PUZZLE.
TREE-PUZZLE provides a means to analyze and reconstruct evolutionary relationships and trees based on quartets, i.e., groups of four sequences. Basic Protocol 1 explains how to reconstruct trees based on the maximum-likelihood principle and quartet puzzling. Basic Protocol 2 discusses likelihood mapping, a method to visualize phylogenetic content in a multiple sequence alignment. Basic Protocol...
متن کاملTREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing
SUMMARY TREE-PUZZLE is a program package for quartet-based maximum-likelihood phylogenetic analysis (formerly PUZZLE, Strimmer and von Haeseler, Mol. Biol. Evol., 13, 964-969, 1996) that provides methods for reconstruction, comparison, and testing of trees and models on DNA as well as protein sequences. To reduce waiting time for larger datasets the tree reconstruction part of the software has ...
متن کاملPhonetic speaker recognition using maximum-likelihood binary-decision tree models
Recent work in phonetic speaker recognition has shown that modeling phone sequences using n-grams is a viable and effective approach to speaker recognition, primarily aiming at capturing speaker-dependent pronunciation and also word usage. This paper describes a method involving binary-tree-structured statistical models for extending the phonetic context beyond that of standard n-grams (particu...
متن کاملMaximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatorial optimization problem of finding a maximum weight hypertree, we prove that it is NP-hard to solve exactly and provide an approximation algorithm with a provable performance guarantee.
متن کاملFinding the Maximum Likelihood Tree is Hard
Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees (Felsenstein, 1981). Finding optimal ML trees appears to be a very hard computational task, but for tractable cases, ML is the method of choice. In particular, algorithms and heuristics for ML take longer to run than algorithms and heuristics for the second major character based criterion, m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Current Protocols in Bioinformatics
سال: 2003
ISSN: 1934-3396
DOI: 10.1002/0471250953.bi0606s01