{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T14:10:45Z","timestamp":1730211045677,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/csb.2003.1227414","type":"proceedings-article","created":{"date-parts":[[2004,3,30]],"date-time":"2004-03-30T17:17:26Z","timestamp":1080667046000},"page":"583-584","source":"Crossref","is-referenced-by-count":1,"title":["Finding higher order motifs under the levenshtein measure"],"prefix":"10.1109","author":[{"given":"E.F.","family":"Adebiyi","sequence":"first","affiliation":[]},{"given":"T.","family":"Dipe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"Extracting common motifs under the levenshtein measure: Theory and experimentation","author":"adebiyi","year":"2002","journal-title":"WABI"},{"key":"ref3","first-page":"5s","article-title":"An efficient algorithm for finding short approximate non-tandem repeats (extended abstract)","volume":"17","author":"adebiyi","year":"2001","journal-title":"ISMB 2001 Bioinformatics"},{"key":"ref10","article-title":"Topological representation of transcriptional regulatory regions","author":"sand","year":"0","journal-title":"manuscript 2002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354"},{"key":"ref11","article-title":"Composite motifs in promoter regions of genes: models and algorithms","author":"sinha","year":"0","journal-title":"General Report 2002"},{"key":"ref5","article-title":"Finding motifs using random projections","author":"buhler","year":"0","journal-title":"RECOMB 2001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.2000.3576"},{"key":"ref8","first-page":"269","article-title":"Combinatorial approaches to finding subtle signals in dna sequences","author":"pevzner","year":"2000","journal-title":"Ismb"},{"key":"ref7","article-title":"Extracting structured motifs using a suffix tree-algorithms and application to promoter consensus identification","author":"marsan","year":"0","journal-title":"RECOMB 2000"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2003.1227414"},{"key":"ref9","first-page":"111","article-title":"Spelling approximate repeated or common motifs using a suffix tree","volume":"1380","author":"sagot","year":"1998","journal-title":"LNCS"},{"journal-title":"Pattern Discovery in Biology and Strings Sorting Theory and Experimentation","year":"2002","author":"adebiyi","key":"ref1"}],"event":{"name":"2003 IEEE Bioinformatics Conference. CSB2003","acronym":"CSB-03","location":"Stanford, CA, USA"},"container-title":["Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8699\/27543\/01227414.pdf?arnumber=1227414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T14:55:06Z","timestamp":1489416906000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1227414\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/csb.2003.1227414","relation":{},"subject":[]}}