1995 · 13 citations · 21 references
Life SciencesBioinformaticsComputational BiologyGenome AssemblyPhylogeneticsSequence AssemblyString AlgorithmsLarge-fragment Dna AssemblyLarge-scale Dna AssemblyMemory-efficient Assembly Algorithms
Article Free Access Share on Large-scale assembly of DNA strings and space-efficient construction of suffix trees Authors: S. Rao Kosaraju Department of Computer Science, The Johns Hopkins University, Baltimore, Maryland Department of Computer Science, The Johns Hopkins University, Baltimore, MarylandView Profile , Arthur L. Delcher Department of Computer Science, Loyola College in Maryland, Baltimore, Maryland Department of Computer Science, Loyola College in Maryland, Baltimore, MarylandView Profile Authors Info & Claims STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computingMay 1995 Pages 169–177https://doi.org/10.1145/225058.225108Published:29 May 1995Publication History 8citation528DownloadsMetricsTotal Citations8Total Downloads528Last 12 Months21Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
21
Linear pattern matching algorithms
Peter Weiner · 1973 · 1.8K citations
A Space-Economical Suffix Tree Construction Algorithm
Edward M. McCreight · Journal of the ACM · 1976 · 1.5K citations · Full text
On-line construction of suffix trees
Esko Ukkonen · Algorithmica · 1995 · 1.5K citations
Fast Algorithms for Finding Nearest Common Ancestors
Dov Harel, Robert E. Tarjan · SIAM Journal on Computing · 1984 · 1.1K citations
AnO(ND) difference algorithm and its variations
Eugene W. Myers · Algorithmica · 1986 · 899 citations