{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:56:23Z","timestamp":1729630583843,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262766","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T18:03:47Z","timestamp":1516298627000},"page":"405-412","source":"Crossref","is-referenced-by-count":0,"title":["Longest alignment with edits in data streams"],"prefix":"10.1109","author":[{"given":"Elena","family":"Grigorescu","sequence":"first","affiliation":[]},{"given":"Erfan Sadeqi","family":"Azer","sequence":"additional","affiliation":[]},{"given":"Samson","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref31","first-page":"81","article-title":"Speech discrimination by dynamic programming","volume":"4","author":"vintsiuk","year":"1968","journal-title":"Kibernetika"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90023-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897577"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch142"},{"key":"ref12","article-title":"Streaming periodicity with mismatches","author":"erg\u00fcn","year":"2017","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques – 21st International Workshop RANDOM (to appear)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.03.006"},{"key":"ref14","first-page":"18:1","article-title":"Tight tradeoffs for real-time approximation of longest palindromes in streams","author":"gawrychowski","year":"2016","journal-title":"27th Annual Symposium on Combinatorial Pattern Matching CPM"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2045092"},{"key":"ref16","volume":"abs 1705 1887","author":"grigorescu","year":"2017","journal-title":"Streaming for aibohphobes Longest palindrome with mismatches"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56024-6_19"},{"journal-title":"Algorithm Design","year":"2006","author":"kleinberg","key":"ref19"},{"key":"ref28","first-page":"21:1","article-title":"Longest common substring with approximately k mismatches","author":"starikovskaya","year":"2016","journal-title":"27th Annual Symposium on Combinatorial Pattern Matching CPM"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195113679.001.0001","author":"apostolico","year":"1997","journal-title":"Pattern Matching Algorithms"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0126070"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488726"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.15"},{"key":"ref29","first-page":"336","article-title":"The communication and streaming complexity of computing the longest common and increasing subsequences","author":"sun","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746612"},{"key":"ref8","first-page":"149","article-title":"Data stream algorithms","volume":"49","author":"chakrabarti","year":"2015","journal-title":"Computer Science"},{"key":"ref7","first-page":"149","article-title":"Palindrome recognition in the streaming model","author":"berenbrink","year":"2014","journal-title":"31st International Symposium on Theoretical Aspects of Computer Science (STACS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16706-0_1"},{"journal-title":"Streaming algorithms for computing edit distance without exploiting suffix trees","year":"2016","author":"chakraborty","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_50"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-7125-x"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu331"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"journal-title":"Data stream algorithms","year":"2004","author":"muthukrishnan","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.69.1.4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.11"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262766.pdf?arnumber=8262766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T17:31:47Z","timestamp":1660325507000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262766","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}