Related references
Note: Only part of the references are listed.De novo assembly of short sequence reads
Konrad Paszkiewicz et al.
BRIEFINGS IN BIOINFORMATICS (2010)
Assembly algorithms for next-generation sequencing data
Jason R. Miller et al.
GENOMICS (2010)
Genome assembly reborn: recent computational challenges
Mihai Pop
BRIEFINGS IN BIOINFORMATICS (2009)
Maximum Likelihood Genome Assembly
Paul Medvedev et al.
JOURNAL OF COMPUTATIONAL BIOLOGY (2009)
Why greed works for shortest common superstring problem
Bin Ma
THEORETICAL COMPUTER SCIENCE (2009)
Extending assembly of short DNA sequences to handle error
William R. Jeck et al.
BIOINFORMATICS (2007)
SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing
Juliane C. Dohm et al.
GENOME RESEARCH (2007)
Assembling millions of short DNA sequences using SSAKE
Rene L. Warren et al.
BIOINFORMATICS (2007)
The greedy algorithm for shortest superstrings
H Kaplan et al.
INFORMATION PROCESSING LETTERS (2005)
High-throughput gene mapping in Caenorhabditis elegans
KA Swan et al.
GENOME RESEARCH (2002)
ARACHNE: A whole-genome shotgun assembler
S Batzoglou et al.
GENOME RESEARCH (2002)
An Eulerian path approach to DNA fragment assembly
PA Pevzner et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2001)
Renyi's divergence and entropy rates for finite alphabet Markov sources
Z Rached et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2001)
Share Paper
