{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:11:34Z","timestamp":1743034294537,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240594"},{"type":"electronic","value":"9783540305491"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30549-1_19","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T19:26:55Z","timestamp":1295206015000},"page":"203-214","source":"Crossref","is-referenced-by-count":5,"title":["Modelling-Alignment for Non-random Sequences"],"prefix":"10.1007","author":[{"given":"David R.","family":"Powell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lloyd","family":"Allison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trevor I.","family":"Dix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1006\/jtbi.1993.1054","volume":"161","author":"L. Allison","year":"1993","unstructured":"Allison, L.: Normalization of affine gap costs used in optimal sequence alignment. Journal of Theoretical Biology\u00a0161, 263\u2013269 (1993)","journal-title":"Journal of Theoretical Biology"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comjnl\/42.1.1","volume":"42","author":"L. Allison","year":"1999","unstructured":"Allison, L., Powell, D.R., Dix, T.I.: Compression and approximate matching. The Computer Journal\u00a042(1), 1\u201310 (1999)","journal-title":"The Computer Journal"},{"key":"19_CR3","unstructured":"Allison, L., Powell, D.R., Dix, T.I.: Modelling is more versatile than shuffling. Technical report, Monash University, School of Computer Science and Software Engineering (2000)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00160262","volume":"35","author":"L. Allison","year":"1992","unstructured":"Allison, L., Wallace, C.S., Yee, C.N.: Finite-state models in the alignment of macromolecules. Journal of Molecular Evolution\u00a035, 77\u201389 (1992)","journal-title":"Journal of Molecular Evolution"},{"issue":"6","key":"19_CR5","first-page":"526","volume":"2","author":"S.F. Altschul","year":"1985","unstructured":"Altschul, S.F., Erickson, B.W.: Significance of nucleotide sequence alignments: A method for random sequence permutation that preserves dinucleotide and codon usage. Mol. Biol. Evol.\u00a02(6), 526\u2013538 (1985)","journal-title":"Mol. Biol. Evol."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0022-2836(86)90289-5","volume":"190","author":"M.J. Bishop","year":"1986","unstructured":"Bishop, M.J., Thompson, E.A.: Maximum likelihood alignment of DNA sequences. J. Mol. Biol.\u00a0190, 159\u2013165 (1986)","journal-title":"J. Mol. Biol."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"6073","DOI":"10.1073\/pnas.95.11.6073","volume":"95","author":"S.E. Brenner","year":"1998","unstructured":"Brenner, S.E., Chothia, C., Hubbard, T.J.P.: Assessing sequence comparison methods with reliable structurally identifed distant evolutionary relationships. Proc. Natl. Acad. Sci.\u00a095, 6073\u20136078 (1998)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0097-8485(93)85010-A","volume":"17","author":"J.-M. Claverie","year":"1993","unstructured":"Claverie, J.-M., States, D.J.: Information enhancement methods for large scale sequence analysis. Comp. Chem\u00a017(2), 191\u2013201 (1993)","journal-title":"Comp. Chem"},{"key":"19_CR9","first-page":"345","volume":"5","author":"M.O. Dayhoff","year":"1978","unstructured":"Dayhoff, M.O., Schwartz, R.M., Orcutt, B.C.: A model of evolutionary change in proteins. Atlas of Protein Sequence and Structure\u00a05, 345\u2013352 (1978)","journal-title":"Atlas of Protein Sequence and Structure"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1093\/bioinformatics\/14.9.755","volume":"14","author":"S.R. Eddy","year":"1998","unstructured":"Eddy, S.R.: Profile hidden Markov models. Bioinformatics\u00a014, 755\u2013763 (1998)","journal-title":"Bioinformatics"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0022-2836(83)90002-5","volume":"163","author":"W.M. Fitch","year":"1983","unstructured":"Fitch, W.M.: Random sequences. Journal of Molecular Biology\u00a0163, 171\u2013176 (1983)","journal-title":"Journal of Molecular Biology"},{"key":"19_CR12","unstructured":"Georgeff, M.P., Wallace, C.S.: A general selection criterion for inductive inference. In: European Conf. on Artificial Intelligence, pp. 473\u2013482 (1984)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"Gotoh, O.: An improved algorithm for matching biological sequences. Journal of Molecular Biology\u00a0162, 705\u2013708 (1982)","journal-title":"Journal of Molecular Biology"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0097-8485(96)80004-0","volume":"20","author":"M. Gribskov","year":"1996","unstructured":"Gribskov, M., Robinson, N.L.: Use of receiver operating characteristic (ROC) analysis to evaluate sequence matching. Computers and Chemistry\u00a020(1), 25\u201333 (1996)","journal-title":"Computers and Chemistry"},{"issue":"6","key":"19_CR15","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/0306-4573(94)90014-0","volume":"30","author":"S. Grumbach","year":"1994","unstructured":"Grumbach, S., Tahi, F.: A new challenge for compression algorithms: genetic sequences. Inf. Proc. and Management\u00a030(6), 875\u2013886 (1994)","journal-title":"Inf. Proc. and Management"},{"issue":"10","key":"19_CR16","first-page":"915","volume":"89","author":"S. Henikoff","year":"1992","unstructured":"Henikoff, S., Henikoff, J.G.: Amino acid substitution matrices from protein blocks. Proc. Natl. Academy Science\u00a089(10), 915\u2013919 (1992)","journal-title":"Proc. Natl. Academy Science"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0166-6851(01)00376-0","volume":"118","author":"R. Huestis","year":"2001","unstructured":"Huestis, R., Fischer, K.: Prediction of many new exons and introns in Plasmodium falciparum chromosome 2. Molecular and Biochemical Parasitology\u00a0118, 187\u2013199 (2001)","journal-title":"Molecular and Biochemical Parasitology"},{"issue":"8","key":"19_CR18","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady\u00a010(8), 707\u2013710 (1966)","journal-title":"Soviet Physics Doklady"},{"key":"19_CR19","unstructured":"Loewenstern, D.M., Yianilos, P.N.: Significantly lower entropy estimates for natural DNA sequences. Technical Report 96-51, DIMACS (December 1996)"},{"issue":"6","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. The Journal of Chemical Physics\u00a021(6), 1087\u20131092 (1953)","journal-title":"The Journal of Chemical Physics"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology\u00a048, 443\u2013453 (1970)","journal-title":"Journal of Molecular Biology"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0076-6879(96)66017-0","volume":"266","author":"W.R. Pearson","year":"1996","unstructured":"Pearson, W.R.: Effective protein sequence comparison. Meth. Enzymol.\u00a0266, 227\u2013258 (1996)","journal-title":"Meth. Enzymol."},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W.R. Pearson","year":"1988","unstructured":"Pearson, W.R., Lipman, D.J.: Improved tools for biological comparison. Proc. Natl. Acad. Sci. USA\u00a085, 2444\u20132448 (1988)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"2","key":"19_CR24","first-page":"131","volume":"13","author":"E. Rivals","year":"1997","unstructured":"Rivals, E., Delgrange, O., Delahaye, J.-P., Dauchet, M., Delorme, M.-O., H\u00e9naut, A., Ollivier, E.: Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. CABIOS\u00a013(2), 131\u2013136 (1997)","journal-title":"CABIOS"},{"issue":"4","key":"19_CR25","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1137\/0126070","volume":"26","author":"P.H. Sellers","year":"1974","unstructured":"Sellers, P.H.: On the theory and computation of evolutionary distances. SIAM J. Appl. Math.\u00a026(4), 787\u2013793 (1974)","journal-title":"SIAM J. Appl. Math."},{"key":"19_CR26","unstructured":"Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. U. of Illinois Press (1949)"},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147, 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"issue":"3","key":"19_CR28","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1111\/j.2517-6161.1987.tb01695.x","volume":"49","author":"C.S. Wallace","year":"1987","unstructured":"Wallace, C.S., Freeman, P.R.: Estimation and inference by compact coding. Journal of the Royal Statistical Society series B\u00a049(3), 240\u2013265 (1987)","journal-title":"Journal of the Royal Statistical Society series B"}],"container-title":["Lecture Notes in Computer Science","AI 2004: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30549-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T21:15:24Z","timestamp":1740863724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30549-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240594","9783540305491"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30549-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}