{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T23:01:18Z","timestamp":1709420478187},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1007\/bf01840391","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T18:41:35Z","timestamp":1119984095000},"page":"313-323","source":"Crossref","is-referenced-by-count":31,"title":["A linear-time algorithm for finding approximate shortest common superstrings"],"prefix":"10.1007","volume":"5","author":[{"given":"Esko","family":"Ukkonen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01840391_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho and M. J. Corasick: Efficient string matching: an aid to bibliographic search.Comm. ACM 18 (1975), 333\u2013340.","journal-title":"Comm. ACM"},{"key":"BF01840391_CR2","volume-title":"Ph.D. Thesis","author":"J. K. Gallant","year":"1982","unstructured":"J. K. Gallant: String Compression Algorithms. Ph.D. Thesis, Princeton University, Princeton, NJ, 1982."},{"key":"BF01840391_CR3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","volume":"20","author":"J. Gallant","year":"1980","unstructured":"J. Gallant, D. Maier, and J. A. Storer: On finding minimal length superstrings.J. Comput. System Sci. 20 (1980), 50\u201358.","journal-title":"J. Comput. System Sci."},{"key":"BF01840391_CR4","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson:Computers and Intractability. Freeman, San Francisco, 1979."},{"key":"BF01840391_CR5","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1093\/nar\/7.2.529","volume":"7","author":"T. R. Gingeras","year":"1979","unstructured":"T. R. Gingeras, J. P. Milazzo, D. Sciaky, and R. J. Roberts: Computer programs for the assembly of DNA sequences.Nucleic Acids Res. 7 (1979), 529\u2013545.","journal-title":"Nucleic Acids Res."},{"key":"BF01840391_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"D. Knuth, J. Morris, and V. Pratt: Fast pattern matching in strings.SIAM J. Comput. 6 (1977), 323\u2013350.","journal-title":"SIAM J. Comput."},{"key":"BF01840391_CR7","first-page":"59","volume-title":"Information Processing","author":"H. Peltola","year":"1983","unstructured":"H. Peltola, J. S\u00f6derlund, J. Tarhio, and E. Ukkonen: Algorithms for some string-matching problems arising in molecular genetics, inInformation Processing (R. E. A. Mason, ed.). Elsevier Science, Amsterdam, 1983, pp. 59\u201364."},{"key":"BF01840391_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/nar\/12.1Part1.307","volume":"12","author":"H. Peltola","year":"1984","unstructured":"H. Peltola, H. S\u00f6derlund, and E. Ukkonen: SEQAID: a DNA sequence assembling program based on a mathematical model.Nucleic Acids Res. 12 (1984), 307\u2013321.","journal-title":"Nucleic Acids Res."},{"key":"BF01840391_CR9","doi-asserted-by":"crossref","first-page":"4731","DOI":"10.1093\/nar\/10.15.4731","volume":"10","author":"R. Staden","year":"1982","unstructured":"R. Staden: Automation of the computer handling of gel reading data produced by the shotgun method of DNA sequencing.Nucleic Acids Res. 10 (1982), 4731\u20134751.","journal-title":"Nucleic Acids Res."},{"key":"BF01840391_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1007\/BFb0016287","volume-title":"Mathematical Foundations of Computer Science","author":"J. Tarhio","year":"1986","unstructured":"J. Tarhio and E. Ukkonen: A greedy algorithm for constructing shortest common superstrings, inMathematical Foundations of Computer Science. Lecture Notes in Computer Science, Vol. 233. Springer-Verlag, Berlin, 1986, pp. 602\u2013610."},{"key":"BF01840391_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","volume":"57","author":"J. Tarhio","year":"1988","unstructured":"J. Tarhio and E. Ukkonen: A greedy approximation algorithm for constructing shortest common superstrings.Theoret. Comput. Sci. 57 (1988), 131\u2013145.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01840391_CR12","series-title":"Technical Report WUCS-86-16","volume-title":"Approximation Algorithms for the Shortest Common Superstring Problem","author":"J. S. Turner","year":"1986","unstructured":"J. S. Turner: Approximation Algorithms for the Shortest Common Superstring Problem. Technical Report WUCS-86-16, Department of Computer Science, Washington University, Saint Louis, MO, 1986."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840391.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840391\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:35:31Z","timestamp":1557416131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":12,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF01840391"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01840391","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}
