This Article 
 Bibliographic References 
 Add to: 
Quartet-Based Phylogeny Reconstruction with Answer Set Programming
January-March 2007 (vol. 4 no. 1)
pp. 139-152
In this paper, a new representation is presented for the Maximum Quartet Consistency (MQC) problem, where solving the MQC problem becomes searching for an ultrametric matrix that satisfies a maximum number of given quartet topologies. A number of structural properties of the MQC problem in this new representation are characterized through formulating into answer set programming, a recent powerful logic programming tool for modeling and solving search problems. Using these properties, a number of optimization techniques are proposed to speed up the search process. The experimental results on a number of simulated data sets suggest that the new representation, combined with answer set programming, presents a unique perspective to the MQC problem.
Index Terms:
Phylogeny, quartet, Maximum Quartet Consistency (MQC), Answer Set Programming (ASP), ultrametric matrix.
Gang Wu, Jia-Huai You, Guohui Lin, "Quartet-Based Phylogeny Reconstruction with Answer Set Programming," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 4, no. 1, pp. 139-152, Jan.-March 2007, doi:10.1109/TCBB.2007.1008
Usage of this product signifies your acceptance of the Terms of Use.