{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T03:45:53Z","timestamp":1719891953223},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"am","delay-in-days":254,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1016\/j.jpdc.2020.05.018","type":"journal-article","created":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T23:28:18Z","timestamp":1591313298000},"page":"68-79","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Sequential and parallel algorithms for all-pairk<\/mml:mi><\/mml:math>-mismatch maximal common substrings"],"prefix":"10.1016","volume":"144","author":[{"given":"Sriram P.","family":"Chockalingam","sequence":"first","affiliation":[]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.jpdc.2020.05.018_b1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1002\/cpe.1553","article-title":"HPCToolkit: Tools for performance analysis of optimized parallel programs","volume":"22","author":"Adhianto","year":"2010","journal-title":"Concurr. Comput.: Pract. Exper."},{"issue":"3","key":"10.1016\/j.jpdc.2020.05.018_b2","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1006\/jagm.1993.1018","article-title":"Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values","volume":"14","author":"Berkman","year":"1993","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"10.1016\/j.jpdc.2020.05.018_b3","first-page":"51","article-title":"Better filtering with gapped q-grams","volume":"56","author":"Burkhardt","year":"2003","journal-title":"Fund. inform."},{"issue":"1","key":"10.1016\/j.jpdc.2020.05.018_b4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/0221005","article-title":"A note on the height of suffix trees","volume":"21","author":"Devroye","year":"1992","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/j.jpdc.2020.05.018_b5","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1145\/355541.355547","article-title":"On the sorting-complexity of suffix tree construction","volume":"47","author":"Farach-Colton","year":"2000","journal-title":"J. ACM"},{"key":"10.1016\/j.jpdc.2020.05.018_b6","series-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","first-page":"459","article-title":"A new succinct representation of RMQ-information and improvements in the enhanced suffix array","author":"Fischer","year":"2007"},{"key":"10.1016\/j.jpdc.2020.05.018_b7","series-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","first-page":"16","article-title":"Parallel distributed memory construction of suffix and longest common prefix arrays","author":"Flick","year":"2015"},{"issue":"5","key":"10.1016\/j.jpdc.2020.05.018_b8","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1101\/gr.114819.110","article-title":"Efficient storage of high throughput DNA sequencing data using reference-based compression","volume":"21","author":"Fritz","year":"2011","journal-title":"Genome Res."},{"issue":"7","key":"10.1016\/j.jpdc.2020.05.018_b9","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1038\/nbt.1883","article-title":"Full-length transcriptome assembly from RNA-Seq data without a reference genome","volume":"29","author":"Grabherr","year":"2011","journal-title":"Nature Biotechnol."},{"key":"10.1016\/j.jpdc.2020.05.018_b10","series-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"Gusfield","year":"1997"},{"issue":"11","key":"10.1016\/j.jpdc.2020.05.018_b11","doi-asserted-by":"crossref","first-page":"2963","DOI":"10.1093\/nar\/gkg379","article-title":"Efficient clustering of large EST data sets on parallel computers","volume":"31","author":"Kalyanaraman","year":"2003","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/j.jpdc.2020.05.018_b12","series-title":"International Symposium on String Processing and Information Retrieval","first-page":"139","article-title":"Improved filters for the approximate suffix-prefix overlap problem","author":"Kucherov","year":"2014"},{"issue":"5","key":"10.1016\/j.jpdc.2020.05.018_b13","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays: a new method for on-line string searches","volume":"22","author":"Manber","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.jpdc.2020.05.018_b14","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.jpdc.2020.05.018_b15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1038\/nrg2626","article-title":"Sequencing technologies \u2013 the next generation","volume":"11","author":"Metzker","year":"2010","journal-title":"Nat. Rev. Genet."},{"issue":"13","key":"10.1016\/j.jpdc.2020.05.018_b16","doi-asserted-by":"crossref","first-page":"e90","DOI":"10.1093\/nar\/gkr344","article-title":"Sequence-specific error profile of Illumina sequencers","volume":"39","author":"Nakamura","year":"2011","journal-title":"Nucleic Acids Res."},{"issue":"4","key":"10.1016\/j.jpdc.2020.05.018_b17","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pcbi.1002464","article-title":"RNA-Seq mapping and detection of gene fusions with a suffix array algorithm","volume":"8","author":"Sakarya","year":"2012","journal-title":"PLoS Comput. Biol."},{"issue":"2","key":"10.1016\/j.jpdc.2020.05.018_b18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.parco.2013.01.002","article-title":"All-pairs computations on many-core graphics processors","volume":"39","author":"Sarje","year":"2013","journal-title":"Parallel Comput."},{"issue":"5","key":"10.1016\/j.jpdc.2020.05.018_b19","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.future.2004.05.014","article-title":"Gene transcript clustering: a comparison of parallel approaches","volume":"21","author":"Scheetz","year":"2005","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"10.1016\/j.jpdc.2020.05.018_b20","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1101\/gr.126953.111","article-title":"Efficient de novo assembly of large genomes using compressed data structures","volume":"22","author":"Simpson","year":"2012","journal-title":"Genome Res."},{"issue":"3","key":"10.1016\/j.jpdc.2020.05.018_b21","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1101\/gr.126953.111","article-title":"Efficient de novo assembly of large genomes using compressed data structures","volume":"22","author":"Simpson","year":"2012","journal-title":"Genome Res."},{"key":"10.1016\/j.jpdc.2020.05.018_b22","series-title":"International Conference on Research in Computational Molecular Biology","first-page":"211","article-title":"Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis","author":"Thankachan","year":"2018"},{"key":"10.1016\/j.jpdc.2020.05.018_b23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.ic.2012.02.002","article-title":"Approximate all-pairs suffix\/prefix overlaps","volume":"213","author":"V\u00e4lim\u00e4ki","year":"2012","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.jpdc.2020.05.018_b24","series-title":"Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731520302975?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731520302975?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T23:29:23Z","timestamp":1696202963000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731520302975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":24,"alternative-id":["S0743731520302975"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2020.05.018","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sequential and parallel algorithms for all-pair -mismatch maximal common substrings","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2020.05.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}