|
26
|
Exact and approximation algorithms for DNA sequence reconstruction
– John D Kececioglu
- 1991
|
|
29
|
A contig assembly program based on sensitive detection of fragment overlaps
– X Huang
- 1992
|
|
32
|
A new algorithm for DNA sequence assembly
– Ramana M. Idury, Michael S. Waterman
- 1995
|
|
38
|
On nding minimal length superstrings
– J Gallant, D Maier, J A Storer
- 1980
|
|
30
|
Toward Simplifying and Accurately Formulating Fragment Assembly
– Eugene W. Myers
- 1995
|
|
82
|
Genomic mapping by fingerprinting random clones: A mathematical analysis
– E S Lander, M S Waterman
- 1988
|
|
234
|
Introduction to computational biology
– M Waterman
- 1995
|
|
10
|
Separating repeats in DNA sequence assembly
– J Kececioglu, J Ju
- 2001
|
|
473
|
DNA sequencing with chain-terminating inhibitors
– F Sanger, S Nicklen, Coulson AR
- 1977
|
|
10
|
Algorithms for some string matching problems arising in molecular genetics
– H Peltola, H Soderlund, J Tarjio, E Ukkonen
- 1983
|
|
65
|
Linear Approximation of Shortest Superstrings
– Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis
- 1991
|
|
2
|
A fragment assembly project environment
– S Miller, E W Myers
|
|
11
|
SEQAID: A DNA sequence assembling program based on a mathematical model
– H Peltola, H Soderlund, E Ukkonen
- 1984
|
|
17
|
Automation of the computer handling of gel reading data produced by the shotgun method of DNA sequencing. Nucleic Acids Res
– R Staden
- 1982
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
64
|
An eulerian path approach to DNA fragment assembly
– P A Pevzner, H Tang, M S Waterman
- 2001
|
|
12
|
The fragment assembly string graph
– E W Myers
- 2005
|
|
6
|
GenFrag 2.1: new features for more robust fragment assembly benchmarks
– M L Engle, C Burks
- 1994
|
|
12
|
A new computer method for the storage and manipulation of DNA gel reading data
– R Staden
- 1980
|
