Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Efficient approximation of convex recolorings
Journal of Computer and System Sciences
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Journal of Computer and System Sciences
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficiently finding the most parsimonious phylogenetic tree via linear programming
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
SplittingHeirs: inferring haplotypes by optimizing resultant dense graphs
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Efficient approximation of convex recolorings
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Convex recolorings of strings and trees: definitions, hardness results and algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On the genealogy of asexual diploids
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Simple reconstruction of binary near-perfect phylogenetic trees
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
| Hi-index | 0.00 |
A parameterized version of the Steiner tree problem in phylogeny is defined, where the parameter measures the amount by which a phylogeny differs from "perfection." This problem is shown to be solvable in polynomial time for any fixed value of the parameter.