{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T22:40:10Z","timestamp":1682980810536},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2004,10]]},"DOI":"10.1109\/tcbb.2004.36","type":"journal-article","created":{"date-parts":[[2005,1,31]],"date-time":"2005-01-31T17:28:20Z","timestamp":1107192500000},"page":"159-170","source":"Crossref","is-referenced-by-count":9,"title":["An O(N\/sup 2\/) algorithm for discovering optimal Boolean pattern pairs"],"prefix":"10.1109","volume":"1","author":[{"given":"H.","family":"Bannai","sequence":"first","affiliation":[]},{"given":"H.","family":"Hyyro","sequence":"additional","affiliation":[]},{"given":"A.","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"M.","family":"Takeda","sequence":"additional","affiliation":[]},{"given":"K.","family":"Nakai","sequence":"additional","affiliation":[]},{"given":"S.","family":"Miyano","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"bibn015911","doi-asserted-by":"publisher","DOI":"10.1145\/369133.369174"},{"key":"bibn01597","first-page":"2009","article-title":"Knowledge Acquisition from Amino Acid Sequences by Machine Learning System BONSAI","volume":"35","author":"shimozono","year":"1994","journal-title":"Trans Information Processing Soc Japan"},{"key":"bibn015912","first-page":"3","article-title":"A String Pattern Regression Algorithm and Its Application to Pattern Discovery in Long Introns","volume":"13","author":"bannai","year":"2002","journal-title":"Genome Informatics"},{"key":"bibn01596","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(02)00219-0"},{"key":"bibn015913","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0630591100"},{"key":"bibn01595","first-page":"127","article-title":"BioProspector: Discovering Conserv-ed DNA Motifs in Upstream Regulatory Regions of Co-Expressed Genes","author":"liu","year":"2001","journal-title":"Proc Pacific Symp Biocomputing"},{"key":"bibn01594","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354"},{"key":"bibn015914","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720004000612"},{"key":"bibn01593","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49730-7_19"},{"key":"bibn015915","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32280-1_7"},{"key":"bibn01592","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1089\/106652700750050826","article-title":"Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification","volume":"7","author":"marsan","year":"2000","journal-title":"J Computational Biology"},{"key":"bibn015916","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"bibn01591","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1998.5.279"},{"key":"bibn015917","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.092538799"},{"key":"bibn015918","doi-asserted-by":"crossref","first-page":"1863","DOI":"10.1101\/gr.1272403","article-title":"Decay Rates of Human mRNAs: Correlation with Functional Characteristics and Sequence Attributes","volume":"13","author":"yang","year":"2003","journal-title":"Genome Research"},{"key":"bibn015910","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg1079"},{"key":"bibn015924","article-title":"Efficient Substring Traversal with Suffix Arrays","author":"kasai","year":"2001"},{"key":"bibn015925","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45784-4_35"},{"key":"bibn015922","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","article-title":"Space Efficient Linear Time Construction of Suffix Arrays","author":"ko","year":"2003","journal-title":"Proc 14th Ann Symp Combinatorial Pattern Matching"},{"key":"bibn015923","first-page":"943","article-title":"Simple Linear Work Suffix Array Construction","author":"k\ufffdrkk\ufffdinen","year":"2003","journal-title":"Proc 30th Int'l Colloquium Automata Languages and Programming"},{"key":"bibn015928","first-page":"230","article-title":"Color Set Size Problem with Applications to String Matching","author":"hui","year":"1992","journal-title":"Proc Third Ann Symp Combinatorial Pattern Matching"},{"key":"bibn015929","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","article-title":"Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications","author":"kasai","year":"2001","journal-title":"Proc 12th Ann Symp Combinatorial Pattern Matching"},{"key":"bibn015926","first-page":"88","article-title":"The LCA Problem Revisited","author":"bender","year":"2000","journal-title":"Proc Latin American Theoretical Informatics"},{"key":"bibn015927","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1155-5"},{"key":"bibn015920","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"bibn015921","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","article-title":"Linear-Time Construction of Suffix Arrays","author":"kim","year":"2003","journal-title":"Proc 14th Ann Symp Combinatorial Pattern Matching"},{"key":"bibn01599","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39644-4_50"},{"key":"bibn01598","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45884-0_21"},{"key":"bibn015932","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9525(01)02616-6"},{"key":"bibn015931","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9525(03)00196-3"},{"key":"bibn015930","doi-asserted-by":"publisher","DOI":"10.1038\/35067025"},{"key":"bibn015935","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30214-8_3"},{"key":"bibn015934","doi-asserted-by":"publisher","DOI":"10.1101\/gr.1645104"},{"key":"bibn015933","doi-asserted-by":"publisher","DOI":"10.1074\/jbc.M010833200"},{"key":"bibn015919","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30219-3_38"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8857\/30204\/01388181.pdf?arnumber=1388181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T22:15:19Z","timestamp":1682979319000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1388181\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,10]]}},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2004.36","relation":{},"ISSN":["1545-5963"],"issn-type":[{"value":"1545-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}
