Articles producció científica> Enginyeria Química

The MultiFurcating Neighbor-Joining Algorithm for Reconstructing Polytomic Phylogenetic Trees

  • Datos identificativos

    Identificador: imarina:9331068
    Autores:
    Fernandez, AlbertoSegura-Alabart, NataliaSerratosa, Francesc
    Resumen:
    Results from phylogenetic analyses that study the evolution of species according to their biological characteristics are frequently structured as phylogenetic trees. One of the most widely used methods for reconstructing them is the distance-based method known as the neighbor-joining (NJ) algorithm. It is known that the NJ algorithm can produce different phylogenetic trees depending on the order of the taxa in the input matrix of evolutionary distances, because the method only yields bifurcating branches or dichotomies. According to this, results and conclusions published in articles that only calculate one of the possible dichotomic phylogenetic trees are somehow biased. We have generalized the formulas used in the NJ algorithm to cope with Multifurcating branches or polytomies, and we have called this new variant of the method the multifurcating neighbor-joining (MFNJ) algorithm. Instead of the dichotomic phylogenetic trees reconstructed by the NJ algorithm, the MFNJ algorithm produces polytomic phylogenetic trees. The main advantage of using the MFNJ algorithm is that only one phylogenetic tree can be obtained, which makes the experimental section of any study completely reproducible and unbiased to external issues such as the input order of taxa.© 2023. The Author(s).
  • Otros:

    Autor según el artículo: Fernandez, Alberto; Segura-Alabart, Natalia; Serratosa, Francesc
    Departamento: Enginyeria Informàtica i Matemàtiques Enginyeria Química
    Autor/es de la URV: Fernández Sabater, Alberto / Segura Alabart, Natàlia / Serratosa Casanelles, Francesc d'Assís
    Palabras clave: Ties in proximity Polytomy Phylogeny Neighbor-joining Models, genetic Distance-based methods Construction Algorithms ties in proximity saitou polytomy neighbor-joining
    Resumen: Results from phylogenetic analyses that study the evolution of species according to their biological characteristics are frequently structured as phylogenetic trees. One of the most widely used methods for reconstructing them is the distance-based method known as the neighbor-joining (NJ) algorithm. It is known that the NJ algorithm can produce different phylogenetic trees depending on the order of the taxa in the input matrix of evolutionary distances, because the method only yields bifurcating branches or dichotomies. According to this, results and conclusions published in articles that only calculate one of the possible dichotomic phylogenetic trees are somehow biased. We have generalized the formulas used in the NJ algorithm to cope with Multifurcating branches or polytomies, and we have called this new variant of the method the multifurcating neighbor-joining (MFNJ) algorithm. Instead of the dichotomic phylogenetic trees reconstructed by the NJ algorithm, the MFNJ algorithm produces polytomic phylogenetic trees. The main advantage of using the MFNJ algorithm is that only one phylogenetic tree can be obtained, which makes the experimental section of any study completely reproducible and unbiased to external issues such as the input order of taxa.© 2023. The Author(s).
    Áreas temáticas: Molecular biology Medicina veterinaria Medicina i Genetics & heredity Genetics General medicine Evolutionary biology Ecology, evolution, behavior and systematics Ciências biológicas iii Ciências biológicas ii Ciências biológicas i Biotecnología Biology, miscellaneous Biodiversidade Biochemistry & molecular biology
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    Direcció de correo del autor: natalia.segura@urv.cat natalia.segura@urv.cat natalia.segura@urv.cat alberto.fernandez@urv.cat francesc.serratosa@urv.cat
    Identificador del autor: 0000-0002-1241-1646 0000-0001-6112-5913
    Fecha de alta del registro: 2024-10-12
    Versión del articulo depositado: info:eu-repo/semantics/publishedVersion
    Enlace a la fuente original: https://link.springer.com/article/10.1007/s00239-023-10134-z
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: Journal Of Molecular Evolution. 91 (6): 773-779
    Referencia de l'ítem segons les normes APA: Fernandez, Alberto; Segura-Alabart, Natalia; Serratosa, Francesc (2023). The MultiFurcating Neighbor-Joining Algorithm for Reconstructing Polytomic Phylogenetic Trees. Journal Of Molecular Evolution, 91(6), 773-779. DOI: 10.1007/s00239-023-10134-z
    DOI del artículo: 10.1007/s00239-023-10134-z
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2023
    Tipo de publicación: Journal Publications
  • Palabras clave:

    Biochemistry & Molecular Biology,Biology, Miscellaneous,Ecology, Evolution, Behavior and Systematics,Evolutionary Biology,Genetics,Genetics & Heredity,Molecular Biology
    Ties in proximity
    Polytomy
    Phylogeny
    Neighbor-joining
    Models, genetic
    Distance-based methods
    Construction
    Algorithms
    ties in proximity
    saitou
    polytomy
    neighbor-joining
    Molecular biology
    Medicina veterinaria
    Medicina i
    Genetics & heredity
    Genetics
    General medicine
    Evolutionary biology
    Ecology, evolution, behavior and systematics
    Ciências biológicas iii
    Ciências biológicas ii
    Ciências biológicas i
    Biotecnología
    Biology, miscellaneous
    Biodiversidade
    Biochemistry & molecular biology
  • Documentos:

  • Cerca a google

    Search to google scholar