{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:08Z","timestamp":1725664568534},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_89","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:53:42Z","timestamp":1330260822000},"page":"506-517","source":"Crossref","is-referenced-by-count":5,"title":["Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)"],"prefix":"10.1007","author":[{"given":"Vineet","family":"Bafna","sequence":"first","affiliation":[]},{"given":"Babu","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In 33rd IEEE Symp. on Foundations of Computer Science, 1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"44_CR2","unstructured":"P. Berman and M. F\u00fcrer. Approximating maximum independent set in bounded degree graphs. In Fifth ACM-SIAM Symp on Discrete Algorithms, pages 365\u2013371, 1994."},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollobas. Extrernal Graph Theory. Academic Press, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"V. Bafna and P. Pevzner. Genome rearrangements and sorting by reversals. In 34th IEEE Symp. on Foundations of Computer Science, pages 148\u2013157, 1993.","DOI":"10.1109\/SFCS.1993.366872"},{"key":"44_CR5","unstructured":"V. Bafna and P. Pevzner. Sorting permutations by transpositions. In The sixth annual ACM-SIAM symposium on discrete algorithms, pages 614\u2013623, 1995."},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1002\/j.1538-7305.1979.tb02972.x","volume":"58","author":"F. R. K. Chung","year":"1978","unstructured":"F. R. K. Chung. On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks. The Bell Systems Technical Journal, 58:1765\u20131777, 1978.","journal-title":"The Bell Systems Technical Journal"},{"key":"44_CR7","unstructured":"M. M. Halld\u00f3rsson. Approximating discrete collections via local improvements. The sixth annual ACM-SIAM symposium on discrete algorithms, pages 160\u2013169, 1995."},{"key":"44_CR8","unstructured":"S. Hannenhalli, C. Chappey, E. Koonin, and P. Pevzner. Scenarios for genome rearrangements: Herpesvirus evolution as a test case. In Proc. of 3rd Intl. Conference on Bioinformatics and Complex Genome Analysis, 1994."},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip. In 27th Annual ACM Symposium on Theory of Computing, 1995.","DOI":"10.1145\/225058.225112"},{"key":"44_CR10","unstructured":"J. D. Kececioglu and R. Ravi. Of mice and men: Evolutionary distances between genomes under translocations. The sixth annual ACM-SIAM symposium on discrete algorithms, pages 604\u2013613, 1995."},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"J. Kececioglu and D. Sankoff. Exact and approximation algorithms for the inversion distance between two permutations. In Proc. of 4th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science 684, pages 87\u2013105. Springer Verlag, 1993.","DOI":"10.1007\/BFb0029799"},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-58094-8_26","volume":"807","author":"J. Kececioglu","year":"1994","unstructured":"J. Kececioglu and D. Sankoff. Efficient bounds for oriented chromosome inversion distance. In Lecture notes in computer science, volume 807, pages 307\u2013325, 1994.","journal-title":"Lecture notes in computer science"},{"key":"44_CR13","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S. B. Needleman","year":"1970","unstructured":"S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443\u2013453, 1970.","journal-title":"Journal of Molecular Biology"},{"key":"44_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T. F. Smith","year":"1981","unstructured":"T. F. Smith and M. S. Waterman. The identification of common molecular sequences. Journal of Molecular Biology, 147:195\u2013197, 1981.","journal-title":"Journal of Molecular Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:56:15Z","timestamp":1605628575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}