Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Multiple genome rearrangements
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Formulations and hardness of multiple sorting by reversals
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
To cut…or not to cut (applications of comparative physical maps in molecular evolution)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An optimal procedure for gap closing in whole genome shotgun sequencing
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
On the Structure of Syntenic Distance
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Partial digest is hard to solve for erroneous input data
Theoretical Computer Science
A 1.375-Approximation Algorithm for Sorting by Transpositions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Tight bounds for string reconstruction using substring queries
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
Genetic algorithm solution for partial digest problem
International Journal of Bioinformatics Research and Applications
| Hi-index | 0.00 |
Abstract: In the last few years theoretical computer scientists have found new challenges in computational molecular biology. We discuss recent advances and present some open combinatorial problems in different areas of computational molecular biology such as genome rearrangements, DNA physical mapping, DNA sequencing and sequence comparison.