{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:14:53Z","timestamp":1759133693220,"version":"3.37.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1186\/1471-2105-10-s1-s13","type":"journal-article","created":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T20:04:49Z","timestamp":1233345889000},"source":"Crossref","is-referenced-by-count":6,"title":["DNA motif alignment by evolving a population of Markov chains"],"prefix":"10.1186","volume":"10","author":[{"given":"Chengpeng","family":"Bi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,30]]},"reference":[{"key":"3196_CR1","first-page":"799","volume":"447","author":"E Birney","year":"2007","unstructured":"Birney E, Stamatoyannopoulos JA, Dutta A, Guigo R, Gingeras TR, Margulies EH, Weng Z: Identification and analysis of functional elements in 1% of the human genome by the ENCODE pilot project. Science. 2007, 447: 799-816.","journal-title":"Science"},{"key":"3196_CR2","doi-asserted-by":"publisher","first-page":"e36","DOI":"10.1371\/journal.pcbi.0020036","volume":"2","author":"KD MacIsaac","year":"2006","unstructured":"MacIsaac KD, Fraenkel E: Practical strategies for discovering regulatory DNA sequence motifs. PLoS Computat Biol. 2006, 2: e36-10.1371\/journal.pcbi.0020026.","journal-title":"PLoS Computat Biol"},{"key":"3196_CR3","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1111\/j.1541-0420.2006.00625.x","volume":"62","author":"H Ji","year":"2006","unstructured":"Ji H, Wong WW: Computational biology: Towards deciphering gene regulatory information in mammalian genomes. Biometrics. 2006, 62: 645-663. 10.1111\/j.1541-0420.2006.00625.x.","journal-title":"Biometrics"},{"key":"3196_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","volume":"1","author":"L Wang","year":"1994","unstructured":"Wang L, Jiang T: On the complexity of multiple sequence alignment. J Comput Biol. 1994, 1: 337-348.","journal-title":"J Comput Biol"},{"key":"3196_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/prot.340070105","volume":"7","author":"CE Lawrence","year":"1990","unstructured":"Lawrence CE, Reilly AA: An expectation maximization algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Structure, Function and Genetics. 1990, 7: 41-51. 10.1002\/prot.340070105.","journal-title":"Proteins: Structure, Function and Genetics"},{"key":"3196_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird AM, Rubin DB: Maximum likelihood from incomplete data via the EM algorithm (with discussion). J Roy Statist Soc Ser B. 1977, 39: 1-38.","journal-title":"J Roy Statist Soc Ser B"},{"key":"3196_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1111\/1467-9868.00082","volume":"59","author":"XL Meng","year":"1997","unstructured":"Meng XL, Dyk D: The EM algorithm \u2013 an old folk-song sung to a fast new tune. J Roy Statist Soc Ser B. 1997, 59: 511-567. 10.1111\/1467-9868.00082.","journal-title":"J Roy Statist Soc Ser B"},{"key":"3196_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1142\/S0219720007002527","volume":"5","author":"CP Bi","year":"2007","unstructured":"Bi CP: SEAM: A stochastic EM-type algorithm for motif-finding in biopolymer sequences. J Bioinform Comput Biol. 2007, 5: 47-77. 10.1142\/S0219720007002527.","journal-title":"J Bioinform Comput Biol"},{"key":"3196_CR9","first-page":"51","volume":"21","author":"T Bailey","year":"1995","unstructured":"Bailey T, Elkan C: Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning. 1995, 21: 51-80.","journal-title":"Machine Learning"},{"key":"3196_CR10","volume-title":"Monte Carlo Strategies in Scientific Computing","author":"JS Liu","year":"2002","unstructured":"Liu JS: Monte Carlo Strategies in Scientific Computing. 2002, New York: Springer-Verlag"},{"key":"3196_CR11","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller A, Teller H: Equations of state calculations by fast computing machines. J Chem Phys. 1953, 21: 1087-1091. 10.1063\/1.1699114.","journal-title":"J Chem Phys"},{"key":"3196_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings WK: Monte Carlo sampling methods using Markov chains and their applications. Biometrika. 1970, 57: 97-109. 10.1093\/biomet\/57.1.97.","journal-title":"Biometrika"},{"key":"3196_CR13","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"CE Lawrence","year":"1993","unstructured":"Lawrence CE, Altschul SF, Boguski MS, Liu JS, Neuwald AF, Wootton JC: Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science. 1993, 262: 208-214. 10.1126\/science.8211139.","journal-title":"Science"},{"key":"3196_CR14","first-page":"127","volume-title":"Proc. Pacific Symposium on Biocomputing (PSB)","author":"X Liu","year":"2001","unstructured":"Liu X, Brutlag DL, Liu JS: BioProspector: Discovering conserved DNA motifs in upstream regulatory regions of co-expressed genes. Proc. Pacific Symposium on Biocomputing (PSB). 2001, 127-138."},{"key":"3196_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3071-5","volume-title":"Monte Carlo Statistical Methods","author":"CP Robert","year":"1999","unstructured":"Robert CP, Casella G: Monte Carlo Statistical Methods. 1999, New York: Springer"},{"key":"3196_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1198\/10618600152418584","volume":"10","author":"DA van Dyk","year":"2001","unstructured":"van Dyk DA, Meng XL: The art of data augmentation. J Comput Graph Stat. 2001, 10: 1-50. 10.1198\/10618600152418584.","journal-title":"J Comput Graph Stat"},{"key":"3196_CR17","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1021\/pr070475q","volume":"7","author":"CP Bi","year":"2008","unstructured":"Bi CP: Data augmentation algorithms for detecting conserved domains in protein sequences: A comparative study. J Proteome Res. 2008, 7: 192-201. 10.1021\/pr070475q.","journal-title":"J Proteome Res"},{"key":"3196_CR18","volume-title":"Markov Chain Monte Carlo in Practice","author":"WR Gilks","year":"1996","unstructured":"Gilks WR, Richardson S, Spielgelhalter DJ: Markov Chain Monte Carlo in Practice. 1996, New York: Chapman and Hall"},{"key":"3196_CR19","first-page":"156","volume-title":"Computing Science and Statistics: Proc. of the 23rd Symposium on the Interface","author":"CJ Geyer","year":"1991","unstructured":"Geyer CJ: Markov chain Monte Carlo maximum likelihood. Computing Science and Statistics: Proc. of the 23rd Symposium on the Interface. 1991, 156-163."},{"key":"3196_CR20","first-page":"317","volume":"10","author":"F Liang","year":"2000","unstructured":"Liang F, Wong WH: Evolutionary Monte Carlo: Applications to C p model sampling and change point problem. Statistica Sinica. 2000, 10: 317-342.","journal-title":"Statistica Sinica"},{"key":"3196_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1020206129842","volume":"50","author":"KB Laskey","year":"2003","unstructured":"Laskey KB, Myers J: Population Markov chain Monte Carlo. Machine Learning. 2003, 50: 175-196. 10.1023\/A:1020206129842.","journal-title":"Machine Learning"},{"key":"3196_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback S, Leibler RA: On information and sufficiency. Ann Math Statist. 1951, 22: 79-86. 10.1214\/aoms\/1177729694.","journal-title":"Ann Math Statist"},{"key":"3196_CR23","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/0022-2836(87)90354-8","volume":"193","author":"O Berg","year":"1987","unstructured":"Berg O, von Hippel PH: Selection of DNA binding sites by regulatory proteins: Statistical-mechanical theory and application to operators and promoters. Journal of Molecular Biology. 1987, 193: 723-750. 10.1016\/0022-2836(87)90354-8.","journal-title":"Journal of Molecular Biology"},{"key":"3196_CR24","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1093\/bioinformatics\/16.1.16","volume":"16","author":"GD Stormo","year":"2000","unstructured":"Stormo GD: DNA binding sites: representation and discovery. Bioinformatics. 2000, 16: 16-23. 10.1093\/bioinformatics\/16.1.16.","journal-title":"Bioinformatics"},{"key":"3196_CR25","first-page":"111","volume-title":"Theoretical informatics, 1380","author":"MF Sagot","year":"1998","unstructured":"Sagot MF: Spelling approximate repeated or common motifs using a suffix tree. Theoretical informatics, 1380. Edited by: Lucchesi C, Moura A. 1998, 111-127."},{"key":"3196_CR26","first-page":"269","volume":"1","author":"P Pevzner","year":"2000","unstructured":"Pevzner P, Sze SH: Combinatorial approaches to finding subtle signals in DNA sequences. Proc. First ISMB Conference. 2000, 1: 269-278.","journal-title":"Proc. First ISMB Conference"},{"key":"3196_CR27","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J Buhler","year":"2002","unstructured":"Buhler J, Tompa M: Finding motifs using random projection. Journal of Computational Biology. 2002, 9: 225-242. 10.1089\/10665270252935430.","journal-title":"Journal of Computational Biology"},{"issue":"suppl 1","key":"3196_CR28","doi-asserted-by":"publisher","first-page":"S207","DOI":"10.1093\/bioinformatics\/17.suppl_1.S207","volume":"17","author":"G Pavesi","year":"2001","unstructured":"Pavesi G, Mauri G, Pesole G: An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics. 2001, 17 (suppl 1): S207-S214.","journal-title":"Bioinformatics"},{"key":"3196_CR29","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1038\/nbt1053","volume":"23","author":"M Tompa","year":"2005","unstructured":"Tompa M, Li N, Bailey TL, Church GM, De Moor B: Assessing computational tools for the discovery of transcription factor binding sites. Nat Biotechnol. 2005, 23: 137-144. 10.1038\/nbt1053.","journal-title":"Nat Biotechnol"},{"key":"3196_CR30","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland JH: Adaptation in Natural and Artificial Systems. 1975, Ann Arbor: Michigan: The University of Michigan Press"},{"key":"3196_CR31","first-page":"275","volume-title":"Proceeding of IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, IEEE","author":"CP Bi","year":"2007","unstructured":"Bi CP: A genetic-based EM motif-finding algorithm for biological sequence analysis. Proceeding of IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, IEEE. 2007, 275-282."},{"key":"3196_CR32","first-page":"189","volume-title":"Proc. 2008 IEEE Congress on Evolutionary Computation (CEC), IEEE","author":"CP Bi","year":"2008","unstructured":"Bi CP: Evolutionary Metropolis sampling in sequence alignment space. Proc. 2008 IEEE Congress on Evolutionary Computation (CEC), IEEE. 2008, 189-194."},{"key":"3196_CR33","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/nar\/gkh169","volume":"32","author":"MC Frith","year":"2004","unstructured":"Frith MC, Hansen U, Spouge JL, Weng Z: Finding functional sequence elements by multiple local alignment. Nucleic Acids Res. 2004, 32: 189-200. 10.1093\/nar\/gkh169.","journal-title":"Nucleic Acids Res"},{"key":"3196_CR34","volume-title":"Information Theory, Inference, and Learning Algorithms","author":"DJC MacKay","year":"2003","unstructured":"MacKay DJC: Information Theory, Inference, and Learning Algorithms. 2003, New York: Cambridge University Press"},{"key":"3196_CR35","unstructured":"The Projection Software. [ http:\/\/www.cse.wustl.edu\/~jbuhler\/pgt\/ ]"},{"key":"3196_CR36","unstructured":"The Weeder Software. [ http:\/\/159.149.109.9\/modtools\/ ]"},{"key":"3196_CR37","doi-asserted-by":"publisher","first-page":"D91","DOI":"10.1093\/nar\/gkh012","volume":"32","author":"A Sandelin","year":"2004","unstructured":"Sandelin A, Alkema W, Engstrom P, Wasserman WW, Lenhard B: JASPAR: an open-access database for eukaryotic transcription factor binding profiles. Nucleic Acids Res. 2004, 32: D91-D94. 10.1093\/nar\/gkh012.","journal-title":"Nucleic Acids Res"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-10-S1-S13.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-10-S1-S13\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-10-S1-S13.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T09:34:12Z","timestamp":1738920852000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-10-S1-S13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":37,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["3196"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-10-s1-s13","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2009,1]]},"article-number":"S13"}}