{"database":"biostudies-literature","file_versions":[],"scores":null,"additional":{"omics_type":["Unknown"],"submitter":["Li L"],"funding":["Strategic Priority Research Program of the Chinese Academy of Sciences","Youth Innovation Promotion Association of CAS","Beijing Nova Program","National Natural Science Foundation of China","National Key Research and Development Program of China","Key Collaborative Research Program of the Alliance of International Science Organizations"],"pubmed_abstract":["Haplotype networks are graphs used to represent evolutionary relationships between a set of taxa and are characterized by intuitiveness in analyzing genealogical relationships of closely related genomes. We here propose a novel algorithm termed McAN that considers mutation spectrum history (mutations in ancestry haplotype should be contained in descendant haplotype), node size (corresponding to sample count for a given node) and sampling time when constructing haplotype network. We show that McAN is two orders of magnitude faster than state-of-the-art algorithms without losing accuracy, making it suitable for analysis of a large number of sequences. Based on our algorithm, we developed an online web server and offline tool for haplotype network construction, community lineage determination"],"journal":["Briefings in bioinformatics"],"pagination":["bbad174"],"full_dataset_link":["https://www.ebi.ac.uk/biostudies/studies/S-EPMC10199771"],"repository":["biostudies-literature"],"pubmed_title":["McAN: a novel computational algorithm and platform for constructing and visualizing haplotype networks."],"pmcid":["PMC10199771"],"funding_grant_id":["32270718","32170678","Z211100002121006","2017141","2021YFC0863300","XDB38060100","ANSO-CR-KP-2022-09","2021YFF0703703"],"pubmed_authors":["Shi L","Wang A","Li C","Bao Y","Zhao W","Tian D","Li L","Li N","Xue Y","Zhu J","Zhang Z","Xu B","Song S"],"additional_accession":[]},"is_claimable":false,"name":"McAN: a novel computational algorithm and platform for constructing and visualizing haplotype networks.","description":"Haplotype networks are graphs used to represent evolutionary relationships between a set of taxa and are characterized by intuitiveness in analyzing genealogical relationships of closely related genomes. We here propose a novel algorithm termed McAN that considers mutation spectrum history (mutations in ancestry haplotype should be contained in descendant haplotype), node size (corresponding to sample count for a given node) and sampling time when constructing haplotype network. We show that McAN is two orders of magnitude faster than state-of-the-art algorithms without losing accuracy, making it suitable for analysis of a large number of sequences. Based on our algorithm, we developed an online web server and offline tool for haplotype network construction, community lineage determination","dates":{"release":"2023-01-01T00:00:00Z","publication":"2023 May","modification":"2025-04-04T09:58:12.676Z","creation":"2024-11-07T12:08:47.299Z"},"accession":"S-EPMC10199771","cross_references":{"pubmed":["37170752"],"doi":["10.1093/bib/bbad174"]}}