Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms

DOI10.1007/11809678_32MaRDI QIDQ3591313zbMATH OpenOpenAlexFDO

Authors Luay Nakhleh, Ge Xia, Iyad Kanj

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Natural language processing (68T50) Linguistics (91F20) Problems related to evolution (92D15)

Recommendations

• The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms
• Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• scientific article; zbMATH DE number 1256738
• Constructing Evolutionary Trees in the Presence of Polymorphic Characters

Cited in

(6)

• Evolution and observation -- a non-standard way to generate formal languages
• scientific article; zbMATH DE number 1936533 (Why is no real title available?)
• Temporal phylogenetic networks and logic programming
• Machines, Computations, and Universality
• The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms
• Seeing the trees and their branches in the network is hard

This page was built for publication: Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms

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