Exact and approximation algorithms for DNA sequence reconstruction

Keywords

Substring, Sequence (biology), Combinatorics, Complement (music), Algorithm

References

No references recorded for this paper.

Cited by

• A new algorithm for de novo genome assemblyMd. Bahlul Haider — 2012
• Algorithmique parallèle du texte : du modèle systolique au modèle CGMThierry Garcia — 2003
• Safe and Complete Contig Assembly Through OmnitigsKenneth A. Ross — 2017
• Handbook of Constraint ProgrammingF. Rossi, P. V. Beek, T. Walsh — 2006
• Computing Maximum-Cardinality Matchings in Sparse General GraphsJohn Kececioglu, A. Justin Pecqueur — 1998
• Assembly algorithms for next-generation sequence dataAakrosh Ratan — 2009
• Algorithms for string matching with applications in molecular biologyJames L. Holloway — 1992
• Computational Molecular BiologyMartin Vingron, Hans‐Peter Lenhof, Petra Mutzel — 1996
• Theoretical Bounds on Mate-Pair Information for Accurate Genome AssemblyHenry Lin — 2013
• Bioinformatics and ConstraintsRolf Backofen, David Gilbert — 2001
• Introduction to computational molecular biologyJoão Carlos Setúbal, João Meidânis — 1997
• Dissecting multiple sequence alignment methodsTobias Rausch — 2010
• Genetic algorithms, operators, and DNA fragment assemblyRebecca J. Parsons, Stephanie Forrest, Christian Burks — 1995
• Toward Simplifying and Accurately Formulating Fragment AssemblyEugene W. Myers — 1995
• Combinatorial algorithms for DNA sequence assemblyJohn Kececioglu, Eugene W. Myers — 1995
• New formulations of the multiple sequence alignment problemThiru S. Arthanari, Hoai An Le Thi — 2011
• Parameterized complexity analysis in computational biologyHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows — 1995
• Rearrangement of DNA fragments: a branch-and-cut algorithmCarlos Eduardo Ferreira, Cid C. de Souza, Yoshiko Wakabayashi — 2002
• A New Algorithm for DNA Sequence AssemblyRamana M. Idury, Michael S. Waterman — 1995
• An exact solution for the Segment-to-Segment multiple sequence alignment problemHans‐Peter Lenhof, Burkhard Morgenstern, Knut Reinert — 1999

Related papers

• The fragment assembly string graphEugene W. Myers — 2005
• An Eulerian path approach to DNA fragment assemblyPavel A. Pevzner, Haixu Tang, Michael S. Waterman — 2001
• Combinatorial algorithms for DNA sequence assemblyJohn Kececioglu, Eugene W. Myers — 1995
• Velvet: algorithms for de novo short read assembly using de Bruijn graphs.Daniel R. Zerbino, Ewan Birney — 2008
• On Finding Minimal Length SuperstringsJohn Kenneth Gallant, David Maier, James Astorer — 1980
• Algorithms for Some String Matching Problems Arising in Molecular GeneticsHannu Peltola, Hans Söderlund, Jorma Tarhio — 1983
• A branch-and-cut algorithm for multiple sequence alignmentKnut Reinert, Hans‐Peter Lenhof, Petra Mutzel — 1997
• Toward Simplifying and Accurately Formulating Fragment AssemblyEugene W. Myers — 1995