Computing Refined Buneman Trees in Cubic Time

Gerth Stølting Brodal; Rolf Fagerberg; Anna Östlin; Christian N. S. Pedersen; Srinivasa Rao Satti

doi:10.1007/978-3-540-39763-2_20

Keywords

Tree (set theory)Pairwise comparisonComputer scienceWeight-balanced treeAlgorithmMeasure (data warehouse)Time complexityBinary treeEvolutionary algorithmMathematicsCombinatoricsDiscrete mathematicsBinary search treeData miningArtificial intelligence

Affiliated Institutions

Related Publications

Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees

Bernard R. Baum

Summary Baum, B. R.: Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. ‐ Taxoni 41: 3–10. 1992. ‐ ISSN 00...

1992 Taxon 555 citations

The K-D-B-tree

John T. Robinson

The problem of retrieving multikey records via range queries from a large, dynamic index is considered. By large it is meant that most of the index must be stored on secondary m...

1981 885 citations

IQPNNI: Moving Fast Through Tree Space and Stopping in Time

Lê Sỹ Vinh

An efficient tree reconstruction method (IQPNNI) is introduced to reconstruct a phylogenetic tree based on DNA or amino acid sequence data. Our approach combines various fast al...

2004 Molecular Biology and Evolution 169 citations

Increasing the Efficiency of Searches for the Maximum Likelihood Tree in a Phylogenetic Analysis of up to 150 Nucleotide Sequences

David A. Morrison

Even when the maximum likelihood (ML) tree is a better estimate of the true phylogenetic tree than those produced by other methods, the result of a poor ML search may be no bett...

2007 Systematic Biology 66 citations

ASTRAL-III: polynomial time species tree reconstruction from partially resolved gene trees

Chao Zhang , Maryam Rabiee , Erfan Sayyari +1 more

Evolutionary histories can be discordant across the genome, and such discordances need to be considered in reconstructing the species phylogeny. ASTRAL is one of the leading met...

2018 BMC Bioinformatics 2476 citations

Publication Info

Year: 2003
Type: book-chapter
Pages: 259-270
Citations: 11
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Computing Refined Buneman Trees in Cubic Time

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

OpenAlex

Cite This

APA Style

                            
                                    Gerth Stølting Brodal, 
                                
                                    Rolf Fagerberg, 
                                
                                    Anna Östlin
                                
                                et al.
                            
                            (2003). 
                            Computing Refined Buneman Trees in Cubic Time. 
                            Lecture notes in computer science
                            
                            , 259-270.
                            https://doi.org/10.1007/978-3-540-39763-2_20

Identifiers

DOI: 10.1007/978-3-540-39763-2_20