{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:15:28Z","timestamp":1648797328258},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"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":[[1995,2]]},"DOI":"10.1007\/bf01188579","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T16:03:45Z","timestamp":1108656225000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Guest Editor's foreword"],"prefix":"10.1007","volume":"13","author":[{"given":"E. W.","family":"Myers","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01188579_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. Altschul","year":"1990","unstructured":"Altschul, S., W. Gish, W. Miller, E. Myers, and D. Lipman, A basic local alignment search tool,J. Mol. Biol. 215 (1990), 403\u2013410.","journal-title":"J. Mol. Biol."},{"key":"BF01188579_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear approximation of shortest superstrings,Proc. 23rd ACM Symp. on Theory of Computation, 1991, pp. 328\u2013336.","DOI":"10.1145\/103418.103455"},{"key":"BF01188579_CR3","doi-asserted-by":"crossref","unstructured":"Chang, W. I. and E. L. Lawler, Approximate matching in sublinear expected time,Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990, pp. 116\u2013124.","DOI":"10.1109\/FSCS.1990.89530"},{"key":"BF01188579_CR4","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.83.20.7821","volume":"83","author":"A. Coulson","year":"1986","unstructured":"Coulson, A., J. Sulston, S. Brenner, and J. Karn, Toward a physical map of the genome of the nematode,Caenorhabditis elegans, Proc. Nat. Acad. Sci. USA 83 (1986), 7821\u20137825.","journal-title":"Caenorhabditis elegans, Proc. Nat. Acad. Sci. USA"},{"key":"BF01188579_CR5","doi-asserted-by":"crossref","first-page":"2653","DOI":"10.1093\/nar\/18.9.2653","volume":"18","author":"A. G. Craig","year":"1990","unstructured":"Craig, A. G., D. Nizetic, J. D. Hoheisel, G. Zehetner, and H. Lehrach, Ordering of cosmid clones covering the Herpes simplex virus type-I (HSV-I) genome\u2014a test case for finger-printing by hybridization,Nucleic Acids Res. 18 (1990), 2653\u20132660.","journal-title":"Nucleic Acids Res."},{"key":"BF01188579_CR6","unstructured":"Doolittle, R. F. (editor), Molecular evolution: Computer analysis of protein and nucleic acid sequence,Methods Enzymology 183 (1990)."},{"key":"BF01188579_CR7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1126\/science.6304883","volume":"221","author":"R. F. Doolittle","year":"1983","unstructured":"Doolittle, R. F., M. W. Hunkapillar, L. E. Hood, S. G. Devare, K. C. Robbins, S. A. Aaronson, and H. N. Antoniades, Simian sarcomaonc gene, v-sis, is derived from the gene (or genes) encoding a platelet-derived growth factor,Science 221 (1983), 275\u2013277.","journal-title":"Science"},{"key":"BF01188579_CR8","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/146637.146650","volume":"39","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D., Z. Galil, R. Giancarlo, and G. F. Italiano, Sparse dynamic programming, I & II,J. Assoc. Comput. Mach. 39 (1992), 519\u2013567.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01188579_CR9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1086\/412935","volume":"57","author":"J. Felsenstein","year":"1982","unstructured":"Felsenstein, J., Numerical methods for inferring evolutionary trees,Quart. Rev. Biol. 57 (1982), 379\u2013404.","journal-title":"Quart. Rev. Biol."},{"key":"BF01188579_CR10","first-page":"263","volume":"6","author":"C. Fields","year":"1990","unstructured":"Fields, C., and C. Soderlund, gm: a practical tool for automating DNA sequence analysis,Comput. Appl. Bio. Sci. 6 (1990), 263\u2013270.","journal-title":"Comput. Appl. Bio. Sci."},{"key":"BF01188579_CR11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0378-1119(83)90060-4","volume":"22","author":"W. M. Fitch","year":"1983","unstructured":"Fitch, W. M., T. F. Smith, and W. W. Ralph, Mapping the order of DNA restriction fragments,Gene 22 (1983), 19\u201329.","journal-title":"Gene"},{"key":"BF01188579_CR12","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1093\/nar\/7.2.529","volume":"7","author":"T. R. Gingeras","year":"1979","unstructured":"Gingeras, T. R., 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":"BF01188579_CR13","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"Gotoh, O., An improved algorithm for matching biological sequences,J. Mol. Biol. 162 (1982), 705\u2013708.","journal-title":"J. Mol. Biol."},{"key":"BF01188579_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0022-2836(92)90130-C","volume":"226","author":"R. Guigo","year":"1992","unstructured":"Guigo, R., S. Knudsen, N. Drake, and T. Smith. Prediction of gene structure,J. Mol Biol. 226 (1992), 141\u2013157.","journal-title":"J. Mol Biol."},{"key":"BF01188579_CR15","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D. S. Hirschberg","year":"1975","unstructured":"Hirschberg, D. S., A linear space algorithm for computing maximal common subsequences,Comm. ACM 18 (1975), 341\u2013343.","journal-title":"Comm. ACM"},{"key":"BF01188579_CR16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0196-8858(91)90017-D","volume":"12","author":"X. Huang","year":"1991","unstructured":"Huang, X., and W. Miller, A time-efficient, linear-space local similarity algorithm,Adv. Appl. Math. 12 (1991), 337\u2013357.","journal-title":"Adv. Appl. Math."},{"key":"BF01188579_CR17","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0092-8674(87)90503-4","volume":"50","author":"Y. Kohara","year":"1987","unstructured":"Kohara, Y., A. Akiyama, and K. Isono, The physical map of the wholeE. coli chromosome: Application of a new strategy for rapid analysis and sorting of a large genomic library,Cell 50 (1987), 495\u2013508.","journal-title":"Cell"},{"key":"BF01188579_CR18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0888-7543(88)90007-9","volume":"2","author":"E. S. Lander","year":"1988","unstructured":"Lander, E. S., and M. S. Waterman, Genomic mapping by fingerprinting random clones: a mathematical analysis,Genomics 2 (1988), 231\u2013239.","journal-title":"Genomics"},{"key":"BF01188579_CR19","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1126\/science.2983426","volume":"227","author":"D. J. Lipman","year":"1985","unstructured":"Lipman, D. J., and W. R. Pearson, Rapid and sensitive protein similarity searches,Science 227 (1985), 1435\u20131441.","journal-title":"Science"},{"key":"BF01188579_CR20","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1073\/pnas.74.2.560","volume":"74","author":"A. M. Maxam","year":"1977","unstructured":"Maxam, A. M., and W. Gilbert, A new method for sequencing DNA,Proc. Nat. Acad. Sci. USA 74 (1977), 560\u2013564.","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"BF01188579_CR21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"E. W. Myers","year":"1994","unstructured":"Myers, E. W., A sublinear algorithm for approximate keyword searching,Algorithmica 12 (1994), 345\u2013374.","journal-title":"Algorithmica"},{"key":"BF01188579_CR22","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1093\/nar\/12.1Part2.717","volume":"12","author":"G. P. Nolan","year":"1984","unstructured":"Nolan, G. P., C. V. Maina, and A. A. Szalay, Plasmid mapping computer program,Nucleic Acids Res. 12 (1984), 717\u2013729.","journal-title":"Nucleic Acids Res."},{"key":"BF01188579_CR23","doi-asserted-by":"crossref","first-page":"7826","DOI":"10.1073\/pnas.83.20.7826","volume":"83","author":"M. V. Olson","year":"1986","unstructured":"Olson, M. V., J. E. Dutchik, M. Y. Graham, G. M. Brodeur, C. Helms, M. Frank, M. MacCollin, R. Scheinman, and T. Frand, Random-clone strategy for genomic restriction mapping in yeast,Proc. Nat. Acad. Sci. USA 83 (1986), 7826\u20137830.","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"BF01188579_CR24","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1093\/nar\/10.1.217","volume":"10","author":"W. Pearson","year":"1982","unstructured":"Pearson, W., Automatic construction of restriction site maps,Nucleic Acids Res. 10 (1982), 217\u2013227.","journal-title":"Nucleic Acids Res."},{"key":"BF01188579_CR25","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/nar\/12.1Part1.307","volume":"12","author":"H. Peltola","year":"1984","unstructured":"Peltola, H., H. S\u00f6derlund, and E. Ukkonen, SEQUAID: a DNA sequence assembly program based on a mathematical model,Nucleic Acids Res. 12 (1984), 307\u2013321.","journal-title":"Nucleic Acids Res."},{"key":"BF01188579_CR26","doi-asserted-by":"crossref","first-page":"5463","DOI":"10.1073\/pnas.74.12.5463","volume":"74","author":"F. Sanger","year":"1977","unstructured":"Sanger, F., S. Nicklen, and A. R. Coulson, DNA sequencing with chain-terminating inhibitors,Proc. Nat. Acad. Sci. USA 74 (1977), 5463\u20135467.","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"BF01188579_CR27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0128004","volume":"28","author":"D. Sankoff","year":"1975","unstructured":"Sankoff, D., Minimum mutation trees of sequences,SIAM J. Appl. Math. 28 (1975), 35\u201342.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01188579_CR28","doi-asserted-by":"crossref","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","volume":"89","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D., G. Leduc, N. Antoine, B. Faquin, B. Franz Lang, and R. Cedergren, Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome,Proc. Nat. Acad. Sci. USA 89 (1992), 6575\u20136579.","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"BF01188579_CR29","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF02459633","volume":"54","author":"M. Schoniger","year":"1992","unstructured":"Schoniger, M., and M. S. Waterman, A local algorithm for DNA sequence alignment with inversions,Bull. Math. Biol. 54 (1992), 521\u2013536.","journal-title":"Bull. Math. Biol."},{"key":"BF01188579_CR30","unstructured":"Searls, D., Investigating the linguistics of DNA with definite clause grammars,Prof. N. American Conf. on Logic Programming, 1989, pp. 189\u2013208."},{"key":"BF01188579_CR31","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1093\/nar\/21.3.607","volume":"21","author":"E. E. Snyder","year":"1993","unstructured":"Snyder, E. E., and G. D. Stormo, Identification of coding regions in genomic DNA sequences: an application of dynamic programming and neural networks,Nucleic Acids Res. 21 (1993), 607\u2013613.","journal-title":"Nucleic Acids Res."},{"key":"BF01188579_CR32","doi-asserted-by":"crossref","first-page":"2601","DOI":"10.1093\/nar\/6.7.2601","volume":"6","author":"R. Staden","year":"1979","unstructured":"Staden, R., A strategy of DNA sequencing employing computer programs,Nucleic Acids Res. 6 (1979), 2601\u20132610.","journal-title":"Nucleic Acids Res."},{"key":"BF01188579_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(89)90044-8","volume":"83","author":"J. Turner","year":"1989","unstructured":"Turner, J., Approximation algorithms for the shortest common superstring problem,Inform. and Comput. 83 (1989), 1\u201320.","journal-title":"Inform. and Comput."},{"key":"BF01188579_CR34","doi-asserted-by":"crossref","first-page":"11261","DOI":"10.1073\/pnas.88.24.11261","volume":"88","author":"E. Uberbacher","year":"1991","unstructured":"Uberbacher, E., and R. Mural, Locating protein-coding regions in human DNA sequences by a multiple sensor-neural network approach,Proc. Nat. Acad. Sci. USA 88 (1991), 11261\u201311265.","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"BF01188579_CR35","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1991","unstructured":"Ukkonen, E., Approximate string-matching with q-grams and maximal matches,Theoret. Comput. Sci. 92 (1991), 191\u2013211.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01188579_CR36","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/0022-2836(87)90478-5","volume":"197","author":"M. S. Waterman","year":"1987","unstructured":"Waterman, M. S., and M. Eggert, A new algorithm for best subsequence alignments with applications to tRNA-rRNA comparison,J. Mol. Biol. 197 (1987), 723\u2013728.","journal-title":"J. Mol. Biol."},{"key":"BF01188579_CR37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., and U. Manber, Fast text searching allowing errors,Comm. ACM 35 (1992), 83\u201390.","journal-title":"Comm. ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188579.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01188579\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:41:44Z","timestamp":1556714504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01188579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["BF01188579"],"URL":"https:\/\/doi.org\/10.1007\/bf01188579","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}