Computability of Models for Sequence Assembly
Authors:
- 23 August 2007
- book chapter
- Published by Springer Nature
- p. 289-301
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The fragment assembly string graphBioinformatics, 2005
- De novo repeat classification and fragment assembly2004
- An Eulerian path approach to DNA fragment assemblyProceedings of the National Academy of Sciences, 2001
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Combinatorial algorithms for DNA sequence assemblyAlgorithmica, 1995
- Toward Simplifying and Accurately Formulating Fragment AssemblyJournal of Computational Biology, 1995
- l-Tuple DNA Sequencing: Computer AnalysisJournal of Biomolecular Structure and Dynamics, 1989
- An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems1983
- On finding minimal length superstringsJournal of Computer and System Sciences, 1980
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973