Computational geometry: an introduction
Computational geometry: an introduction
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Parametric stable marriage and minimum cuts
Information Processing Letters
Trees, stars, and multiple biological sequence alignment
SIAM Journal on Applied Mathematics
Leaf pairs and tree dissections
SIAM Journal on Discrete Mathematics
Autonomous robot vehicles
Aligning sequences via an evolutionary tree: complexity and approximation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Journal of the ACM (JACM)
Parametric Recomuting in Alignment Graphs
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Bounds for Parametric Sequence Comparison
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
| Hi-index | 0.00 |
Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences.