{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:02:42Z","timestamp":1740096162433,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280757"},{"type":"electronic","value":"9783642280764"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28076-4_17","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T08:53:14Z","timestamp":1330332794000},"page":"160-172","source":"Crossref","is-referenced-by-count":1,"title":["Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet"],"prefix":"10.1007","author":[{"given":"Tanaeem M.","family":"Moosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumaiya","family":"Nazeen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rezwana","family":"Reaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-63246-8_14","volume-title":"Structures in Logic and Computer Science","author":"A. Apostolico","year":"1997","unstructured":"Apostolico, A., Breslauer, D.: Of Periods, Quasiperiods, Repetitions and Covers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 236\u2013248. Springer, Heidelberg (1997), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/3-540-63246-8_14"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"A. Apostolico","year":"1993","unstructured":"Apostolico, A., Ehrenfeucht, A.: Efficient Detection of Quasiperiodicities in Strings. Theoretical Computer Science\u00a0119(2), 247\u2013265 (1993)","journal-title":"Theoretical Computer Science"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45138-9_15","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H. Bannai","year":"2003","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Takeda, M.: Inferring Strings from Graphs and Arrays. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 208\u2013217. Springer, Heidelberg (2003), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-540-45138-9_15"},{"issue":"10","key":"17_CR5","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A Fast String Searching Algorithm. Communications of the ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","volume":"44","author":"D. Breslauer","year":"1992","unstructured":"Breslauer, D.: An On-Line String Superprimitivity Test. Information Processing Letters\u00a044(6), 345\u2013347 (1992)","journal-title":"Information Processing Letters"},{"key":"17_CR7","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"289","volume-title":"26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)","author":"J. Clement","year":"2009","unstructured":"Clement, J., Crochemore, M., Rindone, G.: Reverse Engineering Prefix Tables. In: Albers, S., Marion, J.Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a03, pp. 289\u2013300. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2009), \n                    \n                      http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/1825"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-13509-5_23","volume-title":"Combinatorial Pattern Matching","author":"M. Crochemore","year":"2010","unstructured":"Crochemore, M., Iliopoulos, C.S., Pissis, S.P., Tischler, G.: Cover Array String Reconstruction. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 251\u2013259. Springer, Heidelberg (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-13509-5"},{"issue":"1","key":"17_CR9","first-page":"51","volume":"10","author":"J.P. Duval","year":"2005","unstructured":"Duval, J.P., Lecroq, T., Lefebvre, A.: Border Array on Bounded Alphabet. Journal of Automata, Languages and Combinatorics\u00a010(1), 51\u201360 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"17_CR10","first-page":"223","volume":"42","author":"F. Fran\u011bk","year":"2002","unstructured":"Fran\u011bk, F., Gao, S., Lu, W., Ryan, P.J., Smyth, W.F., Sun, Y., Yang, L.: Verifying a border array in linear time. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a042, 223\u2013236 (2002)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-00982-2_36","volume-title":"Language and Automata Theory and Applications","author":"I. Tomohiro","year":"2009","unstructured":"Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.: Counting Parameterized Border Arrays for a Binary Alphabet. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 422\u2013433. Springer, Heidelberg (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-00982-2"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-13509-5_22","volume-title":"Combinatorial Pattern Matching","author":"I. Tomohiro","year":"2010","unstructured":"Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.: Verifying a Parameterized Border Array in O(n\n                  1.5) Time. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 238\u2013250. Springer, Heidelberg (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-13509-5"},{"key":"17_CR13","unstructured":"An Implementation of Algorithm MinArrayToString, Website of German Tischler, King\u2019s College London, \n                    \n                      http:\/\/www.kcl.ac.uk\/staff\/tischler\/src\/recovering-0.0.0.tar.bz2\n                    \n                    \n                   (last accessed on December 12, 2010)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast Pattern Matching in Strings. SIAM Journal on Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-001-0062-2","volume":"32","author":"Y. Li","year":"2002","unstructured":"Li, Y., Smyth, W.F.: Computing the Cover Array in Linear Time. Algorithmica\u00a032(1), 95\u2013106 (2002), \n                    \n                      http:\/\/springerlink.metapress.com\/openurl.asp?genre=article&issn=0178-4617&volume=32&issue=1&spage=95","journal-title":"Algorithmica"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Nazeen, S., Rahman, M.S., Reaz, R.: Indeterminate String Inference Algorithms. Journal of Discrete Algorithms (in press), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.jda.2011.08.002","DOI":"10.1016\/j.jda.2011.08.002"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-89097-3_14","volume-title":"String Processing and Information Retrieval","author":"W.F. Smyth","year":"2008","unstructured":"Smyth, W.F., Wang, S.: New Perspectives on the Prefix Array. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 133\u2013143. Springer, Heidelberg (2008), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-540-89097-3_14"},{"key":"17_CR18","unstructured":"A Systematic Annotation Package for Community Analysis of Genomes, University of Wisconsin - Madison, \n                    \n                      https:\/\/asap.ahabs.wisc.edu\/asap\/download_Source.php?LocationID=&SequenceVersionID=&GenomeID=\n                    \n                    \n                   (last accessed on December 18, 2010)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28076-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:44:16Z","timestamp":1556419456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28076-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280757","9783642280764"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28076-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}