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

DOI10.1007/s00453-007-9046-1zbMath1147.68754OpenAlexW2111773025MaRDI QIDQ930588

Ge Xia, Iyad A. Kanj, Luay Nakhleh

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)

Cites Work

• Unnamed Item
• Mathematical approaches to comparative linguistics
• Unrooted trees for numerical taxonomy
• Algorithms and Computation
• Computational Science – ICCS 2005

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