Approximation algorithms for the shortest common superstring problem
Information and Computation
Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On constructing radiation hybrid maps (extended abstract)
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Building human genome maps with radiation hybrids
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Physical mapping of chromosomes using unique probes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
vLOD: High-Fidelity Walkthrough of Large Virtual Environments
IEEE Transactions on Visualization and Computer Graphics
Improving EAX with restricted 2-opt
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Partial digest is hard to solve for erroneous input data
Theoretical Computer Science
Compressing large boolean matrices using reordering techniques
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
| Hi-index | 0.00 |