{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:46Z","timestamp":1725484306774},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_21","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T21:55:29Z","timestamp":1179266129000},"page":"249-261","source":"Crossref","is-referenced-by-count":0,"title":["Statistical Identification of Uniformly Mutated Segments within Repeats"],"prefix":"10.1007","author":[{"given":"S. Cenk","family":"\u1e62ahinalp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evan","family":"Eichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Berenbrink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Friedetzky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Funda","family":"Ergun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"E. F. Adebiyi, T. Jiang, M. Kaufmann, An Efficient Algorithm for Finding Short Approximate Non-Tandem Repeats, In Proceedings of ISMB 2001.","DOI":"10.1093\/bioinformatics\/17.suppl_1.S5"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"A. N. Arslan, O. Egecioglu, P. A. Pevzner A new approach to sequence comparison: normalized sequence alignment, Proceedings of RECOMB 2001.","DOI":"10.1145\/369133.369146"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bailey J. A., Yavor A. M., Massa H. F., Trask B. J., Eichler E. E., Segmental duplications: organization and impact within the current human genome project assembly, Genome Research 11(6), Jun 2001.","DOI":"10.1101\/gr.GR-1871R"},{"key":"21_CR4","unstructured":"T. Bailey, C. Elkan. Fitting a mixture model by expectation maximization to discover motifs in biopolymers, Proceedings of ISMB 1994, AAAI Press."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"J. Buhler and M. Tompa Finding Motifs Using Random Projections, In Proc. of RECOMB 2001.","DOI":"10.1145\/369133.369172"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"J. Buhler Efficient Large Scale Sequence Comparison by Locality Sensitive Hashing, Bioinformatics17(5), 2001.","DOI":"10.1093\/bioinformatics\/17.5.419"},{"key":"21_CR7","unstructured":"Richard Cole and Ramesh Hariharan, Approximate String Matching: A Simpler Faster Algorithm, Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 463\u2013472, 25\u201327 January 1998."},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02458837","volume":"51","author":"G. A. Churchill","year":"1989","unstructured":"Churchill, G. A. Stochastic models for heterogeneous DNA sequences, Bulletin of Mathemathical Biology 51, 79\u201394 (1989).","journal-title":"Bulletin of Mathemathical Biology"},{"key":"21_CR9","unstructured":"W. Chang and E. Lawler, Approximate String Matching in Sublinear Expected Time, Proc. IEEE Symposium on Foundations of Computer Science, 1990."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1093\/biomet\/77.3.563","volume":"77","author":"Y.-X. Fu","year":"1990","unstructured":"Fu, Y.-X and R. N. Curnow. Maximum likelihood estimation of multiple change points, Biometrika 77, 563\u2013573 (1990).","journal-title":"Biometrika"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1093\/biomet\/82.4.711","volume":"82","author":"P. J. Green","year":"1995","unstructured":"Green, P. J. Reversible Jump Markov chain Monte Carlo Computation and Bayesian Model Determination Biometrika 82, 711\u2013732 (1995)","journal-title":"Biometrika"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"A. L. Halpern Minimally Selected p and Other Tests for a Single Abrupt Change-point in a Binary Sequence Biometrics 55, Dec 1999.","DOI":"10.1111\/j.0006-341X.1999.01044.x"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"A. L. Halpern Multiple Changepoint Testing for an Alternating Segments Model of a Binary Sequence Biometrics 56, Sep 2000.","DOI":"10.1111\/j.0006-341X.2000.00903.x"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"J. E. Horvath, L. Viggiano, B. J. Loftus, M. D. Adams, N. Archidiacono, M. Rocchi, E. E. Eichler Molecular structure and evolution of an alpha satellite\/non-satellite junction at 16p11. Human Molecular Genetics, 2000, Vol 9, No 1.","DOI":"10.1093\/hmg\/9.1.113"},{"key":"21_CR15","unstructured":"Jackson, Strachan, Dover, Human Genome Evolution, Bios Scientific Publishers, 1996."},{"key":"21_CR16","first-page":"409","volume":"15","author":"E. S. Lander","year":"2001","unstructured":"E. S. Lander et al., Initial sequencing and analysis of the human genome, Nature, 15:409, Feb 2001.","journal-title":"Nature"},{"issue":"8","key":"21_CR17","first-page":"707","volume":"10","author":"V. I. Levenshtein","year":"1966","unstructured":"V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Cybernetics and Control Theory, 10(8):707\u2013710, 1966.","journal-title":"Cybernetics and Control Theory"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"T. Mashkova, N. Oparina, I. Alexandrov, O. Zinovieva, A. Marusina, Y. Yurov, M. Lacroix, L. Kisselev, Unequal crossover is involved in human alpha satellite DNA rearrangements on a border of the satellite domain, FEBS Letters, 441 (1998).","DOI":"10.1016\/S0014-5793(98)01600-7"},{"issue":"9","key":"21_CR19","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/34.232078","volume":"15","author":"A. Marzal","year":"1993","unstructured":"A. Marzal and E. Vidal, Computation of normalized edit distances and applications, IEEE Trans. on PAMI, 15(9):926\u2013932, 1993.","journal-title":"IEEE Trans. on PAMI"},{"key":"21_CR20","unstructured":"L. Parida, I. Rigoutsos, A. Floratsas, D. Platt, Y. Gao, Pattern discovery on character sets and real valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm, Proceedings of ACM-SIAM SODA, 2000."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"S. C. Sahinalp and U. Vishkin, Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm, Proc. IEEE Symposium on Foundations of Computer Science, 1996.","DOI":"10.1109\/SFCS.1996.548491"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"George P. Smith Evolution of Repeated DNA Sequences by Unequal Crossover, Science, vol 191, pp 528\u2013535.","DOI":"10.1126\/science.1251186"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"J. D. Thompson, D. G. Higgins, T. J. Gibson, Clustal-W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice, Nucleic Acid Research 1994, Vol. 22, No. 22.","DOI":"10.1093\/nar\/22.22.4673"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"E. Ukkonen, On Approximate String Matching, Proc. Conference on Foundations of Computation Theory, 1983.","DOI":"10.1007\/3-540-12689-9_129"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/0167-9473(96)00007-2","volume":"22","author":"J. Venter","year":"1996","unstructured":"Venter, J. and Steel, S. Finding multiple abrupt change points. Computational Statistics and Data Analysis 22, 481\u2013501. (1996).","journal-title":"Computational Statistics and Data Analysis"},{"key":"21_CR26","first-page":"291","volume":"16","author":"C. Venter","year":"2001","unstructured":"C. Venter et. al., The sequence of the human genome, Science, 16:291, Feb 2001.","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:52:54Z","timestamp":1556398374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}