{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:19:48Z","timestamp":1743052788855,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_18","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"207-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Suri Dipannita","family":"Sayeed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atif","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"18_CR1","unstructured":"Antoniou, P., Crochemore, M., Iliopoulos, C., Peterlongo, P.: Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. In: International Conference on Language and Automata Theory and Applications (2007)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/11812128_8","volume-title":"Implementation and Application of Automata","author":"P Antoniou","year":"2006","unstructured":"Antoniou, P., Holub, J., Iliopoulos, C.S., Melichar, B., Peterlongo, P.: Finding common motifs with gaps using finite automata. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 69\u201377. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11812128_8"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"S4","DOI":"10.1186\/1471-2105-7-S4-S4","volume":"7","author":"Y Chen","year":"2006","unstructured":"Chen, Y., Wan, A., Liu, W.: A fast parallel algorithm for finding the longest common sequence of multiple biosequences. BMC Bioinformatics 7(4), S4 (2006)","journal-title":"BMC Bioinformatics"},{"key":"18_CR4","unstructured":"Huang, G., Lim, A.: An effective branch-and-bound algorithm to solve the k-longest common subsequence problem. In: Proceedings of the 16th European Conference on Artificial Intelligence, pp. 191\u2013195. IOS Press (2004)"},{"issue":"06","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1142\/S0129054105003716","volume":"16","author":"CS Iliopoulos","year":"2005","unstructured":"Iliopoulos, C.S., McHugh, J., Peterlongo, P., Pisanti, N., Rytter, W., Sagot, M.F.: A first approach to finding common motifs with gaps. Int. J. Found. Comput. Sci. 16(06), 1145\u20131154 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Korkin, D., Wang, Q., Shang, Y.: An efficient parallel algorithm for the multiple longest common subsequence (MLCS) problem. In: 2008 37th International Conference on Parallel Processing, ICPP 2008, pp. 354\u2013363. IEEE (2008)","DOI":"10.1109\/ICPP.2008.79"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM (JACM) 25(2), 322\u2013336 (1978)","journal-title":"J. ACM (JACM)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Marsan, L., Sagot, M.F.: Extracting structured motifs using a suffix tree algorithms and application to promoter consensus identification. In: Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, pp. 210\u2013219. ACM (2000)","DOI":"10.1145\/332306.332553"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TKDE.2010.123","volume":"23","author":"Q Wang","year":"2011","unstructured":"Wang, Q., Korkin, D., Shang, Y.: A fast multiple longest common subsequence (MLCS) algorithm. IEEE Trans. Knowl. Data Eng. 23(3), 321\u2013334 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"18_CR10","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1109\/TPDS.2012.202","volume":"24","author":"J Yang","year":"2013","unstructured":"Yang, J., Xu, Y., Sun, G., Shang, Y.: A new progressive algorithm for a multiple longest common subsequences problem and its efficient parallelization. IEEE Trans. Parallel Distrib. Syst. 24(5), 862\u2013870 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:41:03Z","timestamp":1710344463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}