MIKE：一种用于构建系统发育树的超快、无组装和无干扰方法

@article{10.1093/bioinformatics/btae154,
    author = {Wang, Fang and Wang, Yibin and Zeng, Xiaofei and Zhang, Shengcheng and Yu, Jiaxin and Li, Dongxi and Zhang, Xingtan},
    title = "{MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction}",
    journal = {Bioinformatics},
    volume = {40},
    number = {4},
    pages = {btae154},
    year = {2024},
    month = {03},
    abstract = "{Constructing a phylogenetic tree requires calculating the evolutionary distance between samples or species via large-scale resequencing data, a process that is both time-consuming and computationally demanding. Striking the right balance between accuracy and efficiency is a significant challenge.To address this, we introduce a new algorithm, MIKE (MinHash-based k-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303 Zea, 141 Ficus, 67 Oryza, and 43 Saccharum spontaneum samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.MIKE is publicly available on Github at https://github.com/Argonum-Clever2/mike.git.}",
    issn = {1367-4811},
    doi = {10.1093/bioinformatics/btae154},
    url = {https://doi.org/10.1093/bioinformatics/btae154},
    eprint = {https://academic.oup.com/bioinformatics/article-pdf/40/4/btae154/57149237/btae154.pdf},
}