Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Open Combinatorial Problems in computational Molecular Biology
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
A Model and Solution to the DNA Flipping String Problem
A Model and Solution to the DNA Flipping String Problem
Algorithms for optical mapping
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Partitioning K clones: hardness results and practical algorithms for the K-populations problem
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Reconstructing distances in physical maps of chromosomes with nonoverlapping probes
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
| Hi-index | 0.00 |