{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:07Z","timestamp":1750308007428,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,4,23]],"date-time":"2006-04-23T00:00:00Z","timestamp":1145750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,4,23]]},"DOI":"10.1145\/1141277.1141405","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"546-552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Looking for monotonicity properties of a similarity constraint on sequences"],"prefix":"10.1145","author":[{"given":"Ieva","family":"Mitasiunaite","sequence":"first","affiliation":[{"name":"INSA Lyon, LIRIS CNRS UMR, Villeurbanne, France"}]},{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"additional","affiliation":[{"name":"INSA Lyon, LIRIS CNRS UMR, Villeurbanne, France"}]}],"member":"320","published-online":{"date-parts":[[2006,4,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.37"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/267859.267867"},{"key":"e_1_3_2_1_4_1","first-page":"1","volume-title":"Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries","author":"Boulicaut J.-F.","year":"2004","unstructured":"J.-F. Boulicaut . Inductive databases and multiple uses of frequent itemsets: the cInQ approach . In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries , pages 1 -- 23 . Springer-Verlag , 2004 . J.-F. Boulicaut. Inductive databases and multiple uses of frequent itemsets: the cInQ approach. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, pages 1--23. Springer-Verlag, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646288.686763"},{"key":"e_1_3_2_1_6_1","first-page":"47","volume-title":"Handbook of Computational Chemistry","author":"Crochemore M.","year":"2004","unstructured":"M. Crochemore and M.-F. Sagot . Motifs in sequences: Localization and extraction . In Handbook of Computational Chemistry , pages 47 -- 97 . Marcel Dekker , New York , 2004 . M. Crochemore and M.-F. Sagot. Motifs in sequences: Localization and extraction. In Handbook of Computational Chemistry, pages 47--97. Marcel Dekker, New York, 2004."},{"key":"e_1_3_2_1_7_1","first-page":"147","volume-title":"Proceedings IEEE ICDM'03","author":"Dan Lee S.","year":"2003","unstructured":"S. Dan Lee and L. De Raedt . An algebra for inductive query evaluation . In Proceedings IEEE ICDM'03 , pages 147 -- 154 , 2003 . S. Dan Lee and L. De Raedt. An algebra for inductive query evaluation. In Proceedings IEEE ICDM'03, pages 147--154, 2003."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31841-5_7"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772871"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844746"},{"key":"e_1_3_2_1_11_1","first-page":"223","volume-title":"Proceedings VLDB '99","author":"Garofalakis M. N.","year":"1999","unstructured":"M. N. Garofalakis , R. Rastogi , and K. Shim . Spirit: Sequential pattern mining with regular expression constraints . In Proceedings VLDB '99 , pages 223 -- 234 . Morgan Kaufmann Publishers Inc. , 1999 . M. N. Garofalakis, R. Rastogi, and K. Shim. Spirit: Sequential pattern mining with regular expression constraints. In Proceedings VLDB '99, pages 223--234. Morgan Kaufmann Publishers Inc., 1999."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347167"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/240455.240472"},{"key":"e_1_3_2_1_15_1","first-page":"8","article-title":"Binary codes capable of corresting spurious insertions and deletions of ones","volume":"1","author":"Levenshtein V.","year":"1965","unstructured":"V. Levenshtein . Binary codes capable of corresting spurious insertions and deletions of ones . Probl. Inf. Transmission , 1 : 8 -- 17 , 1965 . V. Levenshtein. Binary codes capable of corresting spurious insertions and deletions of ones. Probl. Inf. Transmission, 1:8--17, 1965.","journal-title":"Probl. Inf. Transmission"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009796218281"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645802.669334"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_19_1","first-page":"215","volume-title":"Proceedings IEEE ICDE'01","author":"Pei J.","year":"2001","unstructured":"J. Pei , J. Han , B. Mortazavi-Asl , H. Pinto , Q. Chen , U. Dayal , and M.-C. Hsu . Prefixspan : Mining sequential patterns by prefix-projected growth . In Proceedings IEEE ICDE'01 , pages 215 -- 224 , 2001 . J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. Prefixspan: Mining sequential patterns by prefix-projected growth. In Proceedings IEEE ICDE'01, pages 215--224, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584799"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647815.738453"},{"key":"e_1_3_2_1_22_1","first-page":"322","volume-title":"Proceedings ISMB'95","author":"Sagot M.-F.","year":"1995","unstructured":"M.-F. Sagot , A. Viari , and H. Soldano . A distance-based block searching algorithm . In Proceedings ISMB'95 , pages 322 -- 331 , 1995 . M.-F. Sagot, A. Viari, and H. Soldano. A distance-based block searching algorithm. In Proceedings ISMB'95, pages 322--331, 1995."},{"key":"e_1_3_2_1_23_1","volume-title":"String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, Mass","author":"Sankoff D.","year":"1983","unstructured":"D. Sankoff and J. Kruskal . Time Warps , String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, Mass . Addison-Wesley , 1983 . D. Sankoff and J. Kruskal. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, Mass. Addison-Wesley, 1983."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(94)00095-K"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645337.650382"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007652502315"}],"event":{"name":"SAC06: The 2006 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Dijon France","acronym":"SAC06"},"container-title":["Proceedings of the 2006 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141277.1141405","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1141277.1141405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:31Z","timestamp":1750259191000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141277.1141405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,23]]},"references-count":26,"alternative-id":["10.1145\/1141277.1141405","10.1145\/1141277"],"URL":"https:\/\/doi.org\/10.1145\/1141277.1141405","relation":{},"subject":[],"published":{"date-parts":[[2006,4,23]]},"assertion":[{"value":"2006-04-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}