{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:37:39Z","timestamp":1725993459942},"reference-count":26,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780128114322"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1016\/b978-0-12-809633-8.20316-6","type":"book-chapter","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T23:32:26Z","timestamp":1509147146000},"page":"5-14","source":"Crossref","is-referenced-by-count":1,"title":["Techniques for Designing Bioinformatics Algorithms"],"prefix":"10.1016","author":[{"given":"Massimo","family":"Cafaro","sequence":"first","affiliation":[]},{"given":"Italo","family":"Epicoco","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Pulimeno","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/B978-0-12-809633-8.20316-6_bib1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/A:1018373005182","article-title":"On the solution of linear recurrence equations","volume":"10","author":"Akra","year":"1998","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/B978-0-12-809633-8.20316-6_bib2","unstructured":"Babai, L., 1979. Monte-carlo algorithms in graph isomorphism testing. Technical Report D.M.S. 79-10, Universite de Montreal."},{"key":"10.1016\/B978-0-12-809633-8.20316-6_bib3","unstructured":"Boyer, R., Moore, J., 1981. Mjrty \u2013 A fast majority vote algorithm. Techical Report 32, Institute for Computing Science, University of Texas, Austin."},{"key":"10.1016\/B978-0-12-809633-8.20316-6_bib4","series-title":"Automated Reasoning: Essays in Honor of Woody Bledsoe, Automated Reasoning Series","first-page":"105","article-title":"Mjrty \u2013 A fast majority vote algorithm","author":"Boyer","year":"1991"},{"key":"10.1016\/B978-0-12-809633-8.20316-6_bib5","doi-asserted-by":"crossref","unstructured":"Buhler, J., Tompa, M., 2001. Finding motifs using random projections. In: Proceedings of the 5th Annual International Conference on Computational Biology. RECOMB \u05f301. ACM, New York, NY, USA, pp. 69\u201376. Available at: http:\/\/doi.acm.org\/10.1145\/369133.369172.","DOI":"10.1145\/369133.369172"},{"issue":"2","key":"10.1016\/B978-0-12-809633-8.20316-6_bib6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1089\/10665270252935430","article-title":"Finding motifs using random projections","volume":"9","author":"Buhler","year":"2002","journal-title":"J. Comput. Biol."},{"year":"2009","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/B978-0-12-809633-8.20316-6_bib7"},{"issue":"2","key":"10.1016\/B978-0-12-809633-8.20316-6_bib8","doi-asserted-by":"crossref","DOI":"10.1016\/0022-2836(73)90122-8","article-title":"Studies of simian virus 40 dna. vii. a cleavage map of the sv40 genome","volume":"78","author":"Danna","year":"1973","journal-title":"J.Mol. Biol."},{"issue":"2","key":"10.1016\/B978-0-12-809633-8.20316-6_bib9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(01)00073-1","article-title":"The chords\u05f3 problem","volume":"282","author":"Daurat","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/B978-0-12-809633-8.20316-6_bib10","unstructured":"Freivalds, R., 1977. Probabilistic machines can use less running time. In: IFIP Congress. pp. 839\u2013842."},{"issue":"2","key":"10.1016\/B978-0-12-809633-8.20316-6_bib11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0020-0190(80)90003-4","article-title":"Computing Fibonacci numbers (and similarly defined functions) in log time","volume":"11","author":"Gries","year":"1980","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"10.1016\/B978-0-12-809633-8.20316-6_bib12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/B978-0-12-809633-8.20316-6_bib13","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Comput. J."},{"key":"10.1016\/B978-0-12-809633-8.20316-6_bib14","first-page":"293","article-title":"Multiplication of many-digital numbers by automatic computers","volume":"145","author":"Karatsuba","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"year":"2011","series-title":"Algorithm Design","author":"Kleinberg","key":"10.1016\/B978-0-12-809633-8.20316-6_bib15"},{"year":"1998","series-title":"The Art of Computer Programming, vol. 1\u20133, Boxed Set","author":"Knuth","key":"10.1016\/B978-0-12-809633-8.20316-6_bib16"},{"year":"1992","series-title":"The Design and Analysis of Algorithms","author":"Kozen","key":"10.1016\/B978-0-12-809633-8.20316-6_bib17"},{"year":"2006","series-title":"Introduction to the Design and Analysis of Algorithms","author":"Levitin","key":"10.1016\/B978-0-12-809633-8.20316-6_bib18"},{"year":"1989","series-title":"Introduction to Algorithms: A Creative Approach","author":"Manber","key":"10.1016\/B978-0-12-809633-8.20316-6_bib19"},{"year":"2010","series-title":"Algorithms and Data Structures: The Basic Toolbox","author":"Mehlhorn","key":"10.1016\/B978-0-12-809633-8.20316-6_bib20"},{"year":"2013","series-title":"Randomized Algorithms","author":"Motwani","key":"10.1016\/B978-0-12-809633-8.20316-6_bib21"},{"year":"2011","series-title":"Algorithms","author":"Sedgewick","key":"10.1016\/B978-0-12-809633-8.20316-6_bib22"},{"year":"2010","series-title":"The Algorithm Design Manual","author":"Skiena","key":"10.1016\/B978-0-12-809633-8.20316-6_bib23"},{"key":"10.1016\/B978-0-12-809633-8.20316-6_bib24","doi-asserted-by":"crossref","unstructured":"Skiena, S.S., Smith, W.D., Lemke, P., 1990. Reconstructing sets from interpoint distances (extended abstract). In: Proceedings of the 6th Annual Symposium on Computational Geometry. SCG \u05f390. ACM, New York, NY, pp. 332\u2013339. Available at: http:\/\/doi.acm.org\/10.1145\/98524.98598.","DOI":"10.1145\/98524.98598"},{"issue":"4","key":"10.1016\/B978-0-12-809633-8.20316-6_bib25","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numerische Mathematik"},{"issue":"6","key":"10.1016\/B978-0-12-809633-8.20316-6_bib26","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"Williams","year":"1964","journal-title":"Heapsort. Commun. ACM"}],"container-title":["Encyclopedia of Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128096338203166?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128096338203166?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T17:48:58Z","timestamp":1603216138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780128096338203166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9780128114322"],"references-count":26,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-809633-8.20316-6","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}