{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:00:43Z","timestamp":1753437643522},"reference-count":32,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,1,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: The goal of motif discovery is to detect novel, unknown, and important signals from biology sequences. In most models, the importance of a motif is equal to the sum of the similarity of every single position. In 2006, Song et al. introduced Aggregated Related Column Score (ARCS) measure which includes correlation information to the evaluation of motif importance. The paper showed that the ARCS measure is superior to other measures. Due to the complicated nature of the ARCS motif model, we cannot directly apply existing sequential motif discovery methods to find motifs with high ARCS values.<\/jats:p>\n               <jats:p>Results: This article presents a novel mining algorithm, ARCSMotif, to discover related sequential motifs in biological sequences. ARCS-Motif is applied to 400 PROSITE datasets and compared with five alternative methods (CONSENSUS, Gibbs sampler, MEME, SPLASH and DIALIGN-TX). ARCS-Motif outperforms all the methods in accuracy, and most of the methods in efficiency. Although SPLASH has better efficiency than ARCS-Motif, ARCS-Motif has much better accuracy than SPLASH. On average, ARCS-Motif is able to produce the motifs which are at least 10% better than the best of the alternative methods. Among the 400 PROSITE datasets, ARCS-Motif produces the best motifs for more than 200 families. Other than SPLASH, the execution time of ARCS-Motif is less than a third of that of the fastest alternative method and its execution time grows at the slowest rate with respect to the number of sequences and the average sequence among all methods.<\/jats:p>\n               <jats:p>Availability: Software: http:\/\/beijing.case.edu\/ARCS_Motif\/ARCS_Motif; Results: http:\/\/beijing.case.edu\/ARCS_Motif<\/jats:p>\n               <jats:p>Contact: \u00a0jiong.yang@case.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/btn609","type":"journal-article","created":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T01:13:35Z","timestamp":1228958015000},"page":"183-189","source":"Crossref","is-referenced-by-count":6,"title":["ARCS-Motif: discovering correlated motifs from unaligned biological sequences"],"prefix":"10.1093","volume":"25","author":[{"given":"Shijie","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, OH 44106, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Su","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, OH 44106, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, OH 44106, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2008,12,9]]},"reference":[{"key":"2023013110013944400_B1","doi-asserted-by":"crossref","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","article-title":"Gaped BLAST and PSI-BLAST: a new generation of protein database search programs.","volume":"25","author":"Altschul","year":"1997","journal-title":"Nucleic Acids Res."},{"key":"2023013110013944400_B2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1093\/bioinformatics\/bti1051","article-title":"Conservative extraction of over-represented motifs","volume":"21","author":"Apostolico","year":"2005","journal-title":"Bioinformatics"},{"key":"2023013110013944400_B3","first-page":"15","article-title":"Incremental paradigms of motif discovery.","volume-title":"J. Comput. Biol.","author":"Apostolico","year":"2004"},{"key":"2023013110013944400_B4","first-page":"28","article-title":"Fitting a mixture model by expectation maximization to discover motifs in biopolymers.","volume-title":"Proceedings of the Intelligent Systems Molecular Biology.","author":"Bailey","year":"1994"},{"key":"2023013110013944400_B5","first-page":"28","article-title":"Modeling dependencies in protein-DNA binding sites.","volume-title":"Proceedings of the International Conference on Research in Computational Molecular Biology.","author":"Barash","year":"2003"},{"key":"2023013110013944400_B6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1089\/cmb.1998.5.279","article-title":"Approaches to the automatic discovery of patterns in biosequences.","volume":"5","author":"Brazma","year":"1998","journal-title":"J. Comput. Biol"},{"key":"2023013110013944400_B7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1093\/bioinformatics\/16.4.341","article-title":"SPLASH: structural pattern localization analysis by sequential histograms.","volume":"16","author":"Califano","year":"2000","journal-title":"Bioinformatics"},{"key":"2023013110013944400_B8","first-page":"63","article-title":"Motif detection in protein sequences.","volume-title":"Proceedings of the String and Information Retrieval Symposium and International Workshop on Groupwave.","author":"Gao","year":"1999"},{"key":"2023013110013944400_B10","first-page":"397","article-title":"Meta-MEME: motif-based Hidden Markov Models of biological sequences.","volume":"13","author":"Grundy","year":"1997","journal-title":"Comput. Appl. Biosci"},{"key":"2023013110013944400_B11","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1093\/bioinformatics\/btg1016","article-title":"Detecting protein sequence conservation via metric embeddings.","volume":"19","author":"Halperin","year":"2003","journal-title":"Bioinformatics"},{"key":"2023013110013944400_B12","first-page":"14","article-title":"Mining frequent patterns by pattern-growth: methodology and implications.","volume-title":"ACM SIGKDD Explorations Newsletter, Special Issue on Scalable Data Mining Algorithm.","author":"Han","year":"2000"},{"key":"2023013110013944400_B13","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1093\/bioinformatics\/bti1001","article-title":"Enhanced position weight matrices using mixture models.","volume":"21","author":"Hannenhalli","year":"2005","journal-title":"Bioinformatics"},{"key":"2023013110013944400_B14","first-page":"201","article-title":"Identification of consensus patterns in unaligned DNA and protein sequences: a large-deviation statistical basis for penalizing gaps.","volume-title":"Proceedings of Bioinformatics and Genome Research.","author":"Hertz","year":"1995"},{"key":"2023013110013944400_B15","first-page":"95","article-title":"Hidden Markov models for sequence analysis: extension and analysis of the basic method.","volume":"12","author":"Hughey","year":"1996","journal-title":"Comput. Appl. Biosci"},{"key":"2023013110013944400_B16","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1093\/bioinformatics\/18.10.1374","article-title":"Finding motifs in the twilight zone.","volume":"18","author":"Keich","year":"2002","journal-title":"Bioinformatics"},{"key":"2023013110013944400_B17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1002\/prot.21153","article-title":"iGibbs: improving Gibbs motif sampler for proteins by sequence clustering and iterative pattern sampling.","volume":"66","author":"Kim","year":"2006","journal-title":"Proteins"},{"key":"2023013110013944400_B18","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1126\/science.8211139","article-title":"Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment.","volume":"262","author":"Lawrence","year":"1993","journal-title":"Science"},{"key":"2023013110013944400_B19","doi-asserted-by":"crossref","first-page":"1665","DOI":"10.1093\/nar\/25.9.1665","article-title":"Extracting protein alignment models from the sequence database.","volume":"25","author":"Neuwald","year":"1998","journal-title":"Nucleic Acids Res"},{"key":"2023013110013944400_B20","doi-asserted-by":"crossref","first-page":"5865","DOI":"10.1073\/pnas.95.11.5865","article-title":"Highly specific protein sequence Motifs for genome analysis.","volume":"95","author":"Nevill-Manning","year":"1998","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023013110013944400_B21","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/jmbi.2000.4042","article-title":"A novel method for fast and accurate multiple sequence alignment","volume":"302","author":"Notredame","year":"2000","journal-title":"J. Mol. Biol."},{"key":"2023013110013944400_B22","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010732","volume-title":"Pattern Discovery in Bioinformatics: Theory and Algorithms.","author":"Parida","year":"2007"},{"key":"2023013110013944400_B23","first-page":"297","article-title":"Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm.","volume-title":"Proceedings of ACM-SIAM Symposium on Discrete Algorithms, San Franciso, CA, USA.","author":"Parida","year":"2000"},{"key":"2023013110013944400_B24","first-page":"269","article-title":"Combinatorial algorithm for finding subtle signals in DNA sequences.","volume-title":"Proceedings of International Conference of Intelligent Systems for Molecular Biology.","author":"Pevzner","year":"2000"},{"key":"2023013110013944400_B25","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1089\/cmb.2005.12.1117","article-title":"Exact algorithms for planted motif problems.","volume":"12","author":"Rajasekaran","year":"2005","journal-title":"J. Comput. Biol"},{"key":"2023013110013944400_B26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1093\/bioinformatics\/14.1.55","article-title":"Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm.","volume":"14","author":"Rigoutsos","year":"1998","journal-title":"Bioinformatics"},{"key":"2023013110013944400_B27","doi-asserted-by":"crossref","first-page":"2738","DOI":"10.1073\/pnas.95.6.2738","article-title":"Computational learning reveals coiled coil-like motifs in histidine kinase linker domains.","volume":"95","author":"Singh","year":"1998","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023013110013944400_B28","doi-asserted-by":"crossref","first-page":"2326","DOI":"10.1093\/bioinformatics\/btl398","article-title":"ARCS: an Aggregated Related Column Scoring Scheme for aligned sequences.","volume":"22","author":"Song","year":"2006","journal-title":"Bioinformatics"},{"key":"2023013110013944400_B29","doi-asserted-by":"crossref","first-page":"6097","DOI":"10.1093\/nar\/18.20.6097","article-title":"Sequence Logos: a new way to display consensus sequences.","volume":"18","author":"Schneider","year":"1990","journal-title":"Nucleic Acids Res."},{"key":"2023013110013944400_B30","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1093\/bioinformatics\/16.1.16","article-title":"DNA binding sites: representation and discovery.","volume":"16","author":"Stormo","year":"2000","journal-title":"Bioinformatics"},{"key":"2023013110013944400_B31","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/1748-7188-3-6","article-title":"DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment.","volume":"3","author":"Subramanian","year":"2008","journal-title":"Algorithms Mol. Biol"},{"key":"2023013110013944400_B32","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"SPADE: an efficient algorithm for mining frequent sequences.","volume":"42","author":"Zaki","year":"2001","journal-title":"Mach. Learn"},{"key":"2023013110013944400_B33","unstructured":"PROSITE database\n          Available at: http:\/\/www.expasy.org\/prosite"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/2\/183\/48983468\/bioinformatics_25_2_183.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/2\/183\/48983468\/bioinformatics_25_2_183.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:46:17Z","timestamp":1675190777000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/25\/2\/183\/219804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,9]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,1,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btn609","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2009,1,15]]},"published":{"date-parts":[[2008,12,9]]}}}