{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:11:27Z","timestamp":1750824687503,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319651712"},{"type":"electronic","value":"9783319651729"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-65172-9_52","type":"book-chapter","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T04:38:54Z","timestamp":1501562334000},"page":"620-629","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Computation of Palindromes in Sequences with Uncertainties"],"prefix":"10.1007","author":[{"given":"Mai","family":"Alzamel","sequence":"first","affiliation":[]},{"given":"Jia","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"key":"52_CR1","unstructured":"Alatabbi, A., Iliopoulos, C.S., Rahman, M.S.: Maximal palindromic factorization. In: PSC, pp. 70\u201377 (2013)"},{"issue":"1","key":"52_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/s13015-017-0094-z","volume":"12","author":"Y Almirantis","year":"2017","unstructured":"Almirantis, Y., Charalampopoulos, P., Gao, J., Iliopoulos, C.S., Mohamed, M., Pissis, S.P., Polychronopoulos, D.: On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12(1), 5 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Amir, A., Gotthilf, Z., Shalom, B.R.: Weighted LCS. J. Discrete Algorithms 8(3), 273\u2013281 (2010)","DOI":"10.1016\/j.jda.2010.02.001"},{"issue":"1","key":"52_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(94)00083-U","volume":"141","author":"A Apostolico","year":"1995","unstructured":"Apostolico, A., Breslauer, D., Galil, Z.: Parallel detection of all palindromes in a string. Theoret. Comput. Sci. 141(1), 163\u2013173 (1995)","journal-title":"Theoret. Comput. Sci."},{"issue":"21","key":"52_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1186\/s13015-014-0021-5","volume":"9","author":"C Barton","year":"2014","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Optimal computation of all tandem repeats in a weighted sequence. Algorithms Mol. Biol. 9(21), 21 (2014)","journal-title":"Algorithms Mol. Biol."},{"key":"52_CR6","unstructured":"Barton, C., Kociumaka, T., Liu, C., Pissis, S.P., Radoszewski, J.: Indexing Weighted Sequences: Neat and Efficient. CoRR, abs\/1704.07625 (2017)"},{"key":"52_CR7","unstructured":"Barton, C., Kociumaka, T., Pissis, S.P., Radoszewski, J.: Efficient index for weighted sequences. In: CPM. LIPIcs, vol. 54, pp. 4:1\u20134:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.tcs.2016.04.029","volume":"656","author":"C Barton","year":"2016","unstructured":"Barton, C., Liu, C., Pissis, S.P.: Linear-time computation of prefix table for weighted strings and applications. Theoret. Comput. Sci. 656, 160\u2013172 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-319-48749-6_40","volume-title":"Combinatorial Optimization and Applications","author":"C Barton","year":"2016","unstructured":"Barton, C., Liu, C., Pissis, S.P.: On-line pattern matching on uncertain sequences and applications. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 547\u2013562. Springer, Cham (2016). doi: 10.1007\/978-3-319-48749-6_40"},{"key":"52_CR10","doi-asserted-by":"publisher","unstructured":"Barton, C., Pissis, S.P.: Crochemore\u2019s partitioning on weighted strings and applications. Algorithmica (2017). doi: 10.1007\/s00453-016-0266-0","DOI":"10.1007\/s00453-016-0266-0"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). doi: 10.1007\/10719839_9"},{"key":"52_CR12","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.dam.2015.11.011","volume":"204","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: Polynomial-time approximation algorithms for weighted LCS problem. Discrete Appl. Math. 204, 38\u201348 (2016)","journal-title":"Discrete Appl. Math."},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137\u2013143. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"52_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.jda.2014.08.001","volume":"28","author":"G Fici","year":"2014","unstructured":"Fici, G., Gagie, T., K\u00e4rkk\u00e4inen, J., Kempa, D.: A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28, 41\u201348 (2014)","journal-title":"J. Discrete Algorithms"},{"key":"52_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"52_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-07566-2_16","volume-title":"Combinatorial Pattern Matching","author":"I Tomohiro","year":"2014","unstructured":"Tomohiro, I., Sugimoto, S., Inenaga, S., Bannai, H., Takeda, M.: Computing palindromic factorizations and palindromic covers on-line. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 150\u2013161. Springer, Cham (2014). doi: 10.1007\/978-3-319-07566-2_16"},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., Makris, C., Panagis, Y., Perdikuri, K., Theodoridis, E., Tsakalidis, A.: The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications. Fundamenta Informaticae 71(2, 3), 259\u2013277 (2006)","DOI":"10.3233\/FUN-2006-712-307"},{"key":"52_CR18","unstructured":"Kociumaka, T., Pissis, S.P., Radoszewski, J.: Pattern matching and consensus problems on weighted sequences and profiles. In: ISAAC. LIPIcs, vol. 64, pp. 46:1\u201346:12. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"3","key":"52_CR19","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G Manacher","year":"1975","unstructured":"Manacher, G.: A new linear-time \u201con-line\" algorithm for finding the smallest initial palindrome of a string. J. ACM 22(3), 346\u2013351 (1975)","journal-title":"J. ACM"},{"issue":"4","key":"52_CR20","doi-asserted-by":"crossref","first-page":"1972","DOI":"10.1128\/JVI.03031-13","volume":"88","author":"BM Muhire","year":"2014","unstructured":"Muhire, B.M., Golden, M., Murrell, B., Lefeuvre, P., Lett, J.-M., Gray, A., Poon, A.Y.F., Ngandu, N.K., Semegni, Y., Tanov, E.P., et al.: Evidence of pervasive biologically functional secondary structures within the genomes of eukaryotic single-stranded DNA viruses. J. Virol. 88(4), 1972\u20131989 (2014)","journal-title":"J. Virol."},{"key":"52_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-29516-9_27","volume-title":"Combinatorial Algorithms","author":"M Rubinchik","year":"2016","unstructured":"Rubinchik, M., Shur, A.M.: EERTREE: an efficient data structure for processing palindromes in strings. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 321\u2013333. Springer, Cham (2016). doi: 10.1007\/978-3-319-29516-9_27"}],"container-title":["Communications in Computer and Information Science","Engineering Applications of Neural Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65172-9_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:22:11Z","timestamp":1750792931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65172-9_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319651712","9783319651729"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65172-9_52","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}