{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:41Z","timestamp":1725579041436},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_35","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"349-362","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Reconstruction of RC-Equivalent Strings"],"prefix":"10.1007","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[]},{"given":"P\u00e9ter L.","family":"Erd\u0151s","sequence":"additional","affiliation":[]},{"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0304-3975(99)00334-5","volume":"259","author":"A. Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A.: Words and special factors. Theor. Comput. Sci.\u00a0259(1-2), 145\u2013182 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0304-3975(98)00248-5","volume":"218","author":"A. Luca de","year":"1999","unstructured":"de Luca, A.: On the combinatorics of finite words. Theor. Comput. Sci.\u00a0218(1), 13\u201339 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"35_CR3","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0097-3165(03)00103-1","volume":"103","author":"M. Dud\u00edk","year":"2003","unstructured":"Dud\u00edk, M., Schulman, L.J.: Reconstruction from subsequences. J. Comb. Theory, Ser. A\u00a0103(2), 337\u2013348 (2003)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00026-006-0297-3","volume":"10","author":"P.L. Erd\u0151s","year":"2006","unstructured":"Erd\u0151s, P.L., Ligeti, P., Sziklai, P., Torney, D.C.: Subwords in reverse-complement order. Annals of Combinatorics\u00a010, 415\u2013430 (2006)","journal-title":"Annals of Combinatorics"},{"issue":"1-3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.tcs.2006.03.006","volume":"359","author":"G. Fici","year":"2006","unstructured":"Fici, G., Mignosi, F., Restivo, A., Sciortino, M.: Word assembly through minimal forbidden words. Theor. Comput. Sci.\u00a0359(1-3), 214\u2013230 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1006\/jcta.1997.2732","volume":"77","author":"I. Krasikov","year":"1997","unstructured":"Krasikov, I., Roditty, Y.: On a reconstruction problem for sequences. J. Comb. Theory, Ser. A\u00a077(2), 344\u2013348 (1997)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/18.904499","volume":"47","author":"V.I. Levenshtein","year":"2001","unstructured":"Levenshtein, V.I.: Efficient reconstruction of sequences. IEEE Transactions on Information Theory\u00a047(1), 2\u201322 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"35_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"P. Pevzner","year":"1989","unstructured":"Pevzner, P.: l-tuple DNA sequencing: Computer analysis. Journal of Biomolecular Structure and Dynamics\u00a07, 63\u201373 (1989)","journal-title":"Journal of Biomolecular Structure and Dynamics"},{"issue":"1-3","key":"35_CR9","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2008.01.052","volume":"400","author":"C. Pi\u00f1a","year":"2008","unstructured":"Pi\u00f1a, C., Uzc\u00e1tegui, C.: Reconstruction of a word from a multiset of its factors. Theor. Comput. Sci.\u00a0400(1-3), 70\u201383 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"35_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TCBB.2004.12","volume":"1","author":"F.P. Preparata","year":"2004","unstructured":"Preparata, F.P.: Sequencing-by-hybridization revisited: The analog-spectrum proposal. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a01(1), 46\u201352 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"35_CR11","series-title":"Subwords","volume-title":"Combinatorics on Words, by M. Lothaire","author":"M.-P. Sch\u00fctzenberger","year":"1983","unstructured":"Sch\u00fctzenberger, M.-P., Simon, I.: Combinatorics on Words, by M. Lothaire. Subwords. ch. 6. Cambridge University Press, Cambridge (1983)"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) Automata Theory and Formal Languages. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"},{"issue":"2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1089\/cmb.1995.2.333","volume":"2","author":"S. Skiena","year":"1995","unstructured":"Skiena, S., Sundaram, G.: Reconstructing strings from substrings. Journal of Computational Biology\u00a02(2), 333\u2013353 (1995)","journal-title":"Journal of Computational Biology"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/11538462_38","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"D. Tsur","year":"2005","unstructured":"Tsur, D.: Tight bounds for string reconstruction using substring queries. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 448\u2013459. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T12:06:27Z","timestamp":1558440387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}