Review article · 30 Sep 2005
Research articlePublished 19 Jul 2012
FastJoin, an improved neighbor-joining algorithm
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Reconstructing the evolutionary history of a set of species is an elementary problem in biology, and methods for solving this problem are evaluated based on two characteristics: accuracy and efficiency. Neighbor-joining reconstructs phylogenetic trees by iteratively picking a pair of nodes to merge as a new node until only one node remains; due to its good accuracy and speed, it has been embraced by the phylogeny research community. With the advent of large amounts of data, improved fast and precise methods for reconstructing evolutionary trees have become necessary. We improved the neighbor-joining algorithm by iteratively picking two pairs of nodes and merging as two new nodes, until only one node remains. We found that another pair of true neighbors could be chosen to merge as a new node besides the pair of true neighbors chosen by the criterion of the neighbor-joining method, in each iteration of the clustering procedure for the purely additive tree. These new neighbors will be selected by another iteration of the neighbor-joining method, so that they provide an improved neighbor-joining algorithm, by iteratively picking two pairs of nodes to merge as two new nodes until only one node remains, constructing the same phylogenetic tree as the neighbor-joining algorithm for the same input data. By combining the improved neighbor-joining algorithm with styles upper bound computation optimization of RapidNJ and external storage of ERapidNJ methods, a new method of reconstructing phylogenetic trees, FastJoin, was proposed. Experiments with sets of data showed that this new neighbor-joining algorithm yields a significant speed-up compared to classic neighbor-joining, showing empirically that FastJoin is superior to almost all other neighbor-joining implementations.
Subjects
Genetics & Molecular BiologyAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · 31 Jul 2015
A fast neighbor joining method
Research article · 2012
MINER: An Improved Adaptive Join Algorithm
Conference abstract · 7 Sep 2017
Implementation and performance comparison of Wilson, holdout, and Multiedit algorithm for edited k-nearest neighbor
Research article · 2017
Geo ip detection of credit card fraud using knearest neighbor algorithm
More from this journal
The newest in Genetics and Molecular Research.
Article · 3 Nov 2026
Unraveling genetic variability and diversity for the enhancement of yield and yield contributing traits in finger millet (Eleusine coracana L.) under semi arid climatic niches.
Article · 22 Oct 2026
Comparison of the Effectiveness of Red and Yellow Watermelon Extracts as Natural Tooth Bleaching Agents on Discolored Teeth
Article · 16 Jan 2026
The exploration of potential relationship between COPD and LUAD based on single-cell sequencing and bulk transcriptome sequencing
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalGenetics and Molecular Research
- SubjectGenetics & Molecular Biology
- BylineArticles whose byline prints “J. Wang”
- BylineArticles whose byline prints “M.-Z. Guo”
- BylineArticles whose byline prints “L.L. Xing”
