The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms

DOI10.1007/S00453-007-9046-1MaRDI QIDQ930588zbMATH OpenOpenAlexFDO

Authors Iyad Kanj, Luay Nakhleh, Ge Xia

Publication date 1 July 2008

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9046-1

zbMATH Keywords

LinguisticsParameterized algorithms and complexityPhylogenetic networks

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• Seeing the trees and their branches in the network is hard
• Publication:4886095
• scientific article; zbMATH DE number 437563

Cites work

• scientific article; zbMATH DE number 871928 (Why is no real title available?)
• Algorithms and Computation
• Computational Science – ICCS 2005
• Mathematical approaches to comparative linguistics
• Unrooted trees for numerical taxonomy

Cited in

(3)

• Combinatorial views on persistent characters in phylogenetics
• Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors
• Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms

This page was built for publication: The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930588)