A Scalable Method for Identifying Frequent Subtrees in Sets of Large Phylogenetic Trees

BMC Bioinformatics - United Kingdom
doi 10.1186/1471-2105-13-256
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Discovering Frequent Agreement Subtrees From Phylogenetic Data

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
2008English

A Randomized Algorithm for Comparing Sets of Phylogenetic Trees

2007English

SPRIT: Identifying Horizontal Gene Transfer in Rooted Phylogenetic Trees

BMC Evolutionary Biology
EvolutionEcologySystematicsBehavior
2010English

Partition Based Single Scan Method for Mining Frequent Item Sets

International Journal of Engineering and Advanced Technology
EngineeringComputer Science ApplicationsEnvironmental Engineering
2019English

A Collapsing Method for the Efficient Recovery of Optimal Edges in Phylogenetic Trees

English

Rec-I-Dcm3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees

English

Modified K-Tuple Method for the Construction of Phylogenetic Trees

Trends in Bioinformatics
Computational TheoryComputer Science ApplicationsMathematics
2015English

Identifying Large Sets of Unrelated Individuals and Unrelated Markers

Source Code for Biology and Medicine
Computer Science ApplicationsInformation SystemsManagementHealth Informatics
2014English

A Scalable and Modular Material Point Method for Large-Scale Simulations

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy