A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Approximation algorithms for the shortest common superstring problem
Information and Computation
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
Genetic Algorithms for DNA Sequence Assembly
Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology
Gene assembly in ciliates: computing by folding and recombination
A half-century of automata theory
Bioinformatics—an introduction for computer scientists
ACM Computing Surveys (CSUR)
Reference-based alignment in large sequence databases
Proceedings of the VLDB Endowment
Estimating bacterial diversity from environmental DNA: a maximum likelihood approach
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Recent advances in DNA sequencing technology portend the determination of the complete DNA sequences of humans, mouse, and several other species of biological importance in the next five years. Sequencing DNA involves computation in an integral and potent way: the sequencing protocol affects the nature of the computation required and what can be computed constrains the nature of potential protocols. This article provides an introduction to the methods of DNA sequencing for the computational scientist, a brief survey of the algorithmic work to date, and current developments in the final push to sequence the human genome.