Searching for "A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Whole-Genome DNA-Sequencing
by Gene Myers, Celera Genomics, C Omputational, B Iology — 1999 — IEEE Computational Engineering and Science
…–5, 1994, pp. 345–374. 6. J. Turner, “Approximation Algorithms for the Shortest Common Superstring Problem…
Cited by 12 (0 self) – Add To MetaCart

Panorama: Extending Digital Libraries with Topical Crawlers
by Gautam Pant, Kostas Tsioutsiouliklis, Judy Johnson, C. Lee Giles
… algorithms for DNA sequence assembly 1. A greedy approximation algorithm for constructing shortest common…
Cited by 8 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB