{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T04:40:19Z","timestamp":1736311219257,"version":"3.32.0"},"publisher-location":"Boston","reference-count":99,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"0387405321"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-27705-6_21","type":"book-chapter","created":{"date-parts":[[2006,3,23]],"date-time":"2006-03-23T06:57:04Z","timestamp":1143097024000},"page":"657-695","source":"Crossref","is-referenced-by-count":0,"title":["Bioinformatics"],"prefix":"10.1007","author":[{"given":"Srinivas","family":"Aluru","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch (2004): Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms, 2.","DOI":"10.1016\/S1570-8667(03)00065-0"},{"key":"21_CR2","volume-title":"Molecular Biology of the Cell","author":"B. Alberts","year":"2002","unstructured":"B. Alberts, A. Hohnson, J. Lewis, M. Raff, K. Roberts, and P. Walter (2002): Molecular Biology of the Cell. Garland Science, New York, NY."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/0022-2836(91)90193-A","volume":"219","author":"S.F. Altschul","year":"1991","unstructured":"S.F. Altschul (1991): Amino acid substitution matrices from an information theory perspective. Journal of Molecular Biology, 219:555\u2013565.","journal-title":"Journal of Molecular Biology"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jmbi.1990.9999","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman (1990): Basic local alignment search tool. Journal of Molecular Biology, 215(3), 403\u2013410.","journal-title":"Journal of Molecular Biology"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S.F. Altschul","year":"1997","unstructured":"S.F. Altschul, T.L. Madden, A.A. Schaffer, J. Zhang, Z. Zhang, W. Miller, and D.J. Lipman (1997): Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Research, 25, 3389\u20133402.","journal-title":"Nucleic Acids Research"},{"volume-title":"Handbook of Computational Molecular Biology","year":"2005","key":"21_CR6","unstructured":"S. Aluru, (ed) (2005): Handbook of Computational Molecular Biology. CRC Press, Boca Raton, FL."},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/S0743-7315(03)00010-8","volume":"63","author":"S. Aluru","year":"2003","unstructured":"S. Aluru, N. Futamura, and K. Mehrotra (2003): Parallel biological sequence comparison using prefix computations. Journal of Parallel and Distributed Computing, 63(3), 264\u2013272.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"21_CR8","first-page":"29","volume":"8","author":"M.A. Ansari-Lari","year":"1998","unstructured":"M.A. Ansari-Lari, J.C. Oeltjen, S. Schwartz, Z. Zhang, D.M. Muzny, J. Lu, J.H. Gorrell, A.C. Chinault, J.W. Belmont, W. Miller, and R.A. Gibbs (1998): Comparative sequence analysis of a gene-rich cluster at human chromosome 12p13 and its syntenic region in mouse chromosome 6. Genome Research, 8, 29\u201340.","journal-title":"Genome Research"},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"D.A. Bader, B. M.E. Moret, and M. Yan (2001): A linear-time algorithm for computing inversion distance between two signed permutations with an experimental study. Journal of Computational Biology, 8(5), 483\u2013491.","journal-title":"Journal of Computational Biology"},{"key":"21_CR10","first-page":"239","volume":"12","author":"V. Bafna","year":"1995","unstructured":"V. Bafna and P.A. Pevzner (1995): Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution, 12, 239\u2013246.","journal-title":"Molecular Biology and Evolution"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V. Bafna","year":"1996","unstructured":"V. Bafna and P.A. Pevzner (1996): Genome rearrangements and sorting by reversals. SIAM Journal on Computing, 25(2), 272\u2013289.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1101\/gr.208902","volume":"12","author":"S. Batzoglou","year":"2002","unstructured":"S. Batzoglou, D. Jaffe, K. Stanley, J. Butler, et al. (2002): ARACHNE: A wholegenome shotgun assembler. Genome Research, 12, 177\u2013189.","journal-title":"Genome Research"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1101\/gr.10.7.950","volume":"10","author":"S. Batzoglou","year":"2000","unstructured":"S. Batzoglou, L. Pachter, J.P. Mesirov, B. Berger, and E.S. Lander (2000): Human and mouse gene structure: comparative analysis and application to exon prediction. Genome Research, 10, 950\u2013958.","journal-title":"Genome Research"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1038\/420515a","volume":"420","author":"M.S. Boguski","year":"2002","unstructured":"M.S. Boguski (2002): Comparative genomics: the mouse that roared. Nature, 420, 515\u2013516.","journal-title":"Nature"},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"4992","DOI":"10.1093\/nar\/23.24.4992","volume":"24","author":"J.K. Bonfield","year":"1995","unstructured":"J.K. Bonfield, K. Smith, and R. Staden. (1995): A new DNA sequence assembly program. Nucleic Acids Research, 24, 4992\u20132999.","journal-title":"Nucleic Acids Research"},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","volume":"409","author":"International Human Genome Sequencing Consortium","year":"2001","unstructured":"International Human Genome Sequencing Consortium (2001): Initial sequencing and analysis of the human genome. Nature, 409, 860\u2013921.","journal-title":"Nature"},{"key":"21_CR17","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1038\/nature01262","volume":"420","author":"Mouse Genome Sequencing Consortium","year":"2002","unstructured":"Mouse Genome Sequencing Consortium (2002): Initial sequencing and comparative analysis of the mouse genome. Nature, 420, 520\u2013562.","journal-title":"Nature"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0168-9525(01)02525-2","volume":"18","author":"E. Coward","year":"2002","unstructured":"E. Coward, S. A. Haas, and M. Vingron. (2002): SpliceNest: visualizing gene structure and alternative splicing based on EST clusters. Trends in Genetics, 18(1), 53\u201355.","journal-title":"Trends in Genetics"},{"key":"21_CR19","unstructured":"M. Crochemore, G.M. Landau, and Z. Ziv-Ukelson (2002): A subquadratic sequence alignment algorithm for unrestricted cost metrics. In Proc. Symposium on Discrete Algorithms, pp. 679\u2013688."},{"key":"21_CR20","first-page":"345","volume":"5","author":"M.O. Dayhoff","year":"1978","unstructured":"M.O. Dayhoff, R. Schwartz, and B.C. Orcutt (1978): Atlas of Protein Sequence and Structure, volume 5. A model of evolutionary change in proteins: matrices for detecting distant relationships, pp. 345\u2013358. National Biomedical Research Foundation.","journal-title":"Atlas of Protein Sequence and Structure"},{"key":"21_CR21","first-page":"228","volume":"27","author":"A.L. Delcher","year":"1999","unstructured":"A.L. Delcher, S. Kasif, R.D. Fleischmann, J. Peterson, O. While, and S.L. Salzberg (1999): Alignment of whole genomes. Nucleic Acids Research, 27, 228\u2013233.","journal-title":"Nucleic Acids Research"},{"key":"21_CR22","unstructured":"R. Durbin, S.R. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids."},{"issue":"3","key":"21_CR23","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02427852","volume":"17","author":"E.W. Edmiston","year":"1988","unstructured":"E.W. Edmiston, N.G. Core, J.H. Saltz, and R.M. Smith (1988): Parallel processing of biological sequence comparison algorithms. International Journal of Parallel Programming, 17(3), 259\u2013275.","journal-title":"International Journal of Parallel Programming"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1093\/bioinformatics\/bth017","volume":"20","author":"S. Emrich","year":"2004","unstructured":"S. Emrich, S. Aluru, Y. Fu, T. Wen, et al. (2004): A strategy for assembling the maize (zea mays L.) genome. Bioinformatics, 20, 140\u2013147.","journal-title":"Bioinformatics"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"M. Farach (1997): Optimal suffix tree construction with large alphabets. In 38th Annual Symposium on Foundations of Computer Science, pp. 137\u2013143. IEEE.","DOI":"10.1109\/SFCS.1997.646102"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"M. Farach-Colton, P. Ferragina, and S. Muthukrishnan (2000): On the sorting-complexity of suffix tree construction. Journal of the Association of Computing Machinery, 47.","DOI":"10.1145\/355541.355547"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(01)00206-2","volume":"118","author":"D. Fern\u00e1ndez-Baca","year":"2002","unstructured":"D. Fern\u00e1ndez-Baca, T. Seppalainen, and G. Slutzki (2002): Bounds for parametric sequence comparison. Discrete Applied Mathematics, 118, 181\u2013198.","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"P. Ferragina and G. Manzini (2000): Opportunistic data structures with applications. In 41th Annual Symposium on Foundations of Computer Science, pp. 390\u2013398. IEEE.","DOI":"10.1109\/SFCS.2000.892127"},{"issue":"1","key":"21_CR29","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1093\/nar\/12.1Part1.175","volume":"12","author":"J. Fickett","year":"1984","unstructured":"J. Fickett (1984): Fast optimal alignment. Nucleic Acids Research, 12(1), 175\u2013179.","journal-title":"Nucleic Acids Research"},{"issue":"5223","key":"21_CR30","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1126\/science.7542800","volume":"269","author":"R.D. Fleischmann","year":"1995","unstructured":"R.D. Fleischmann, M.D. Adams, O. White, R.A. Clayton, et al. (1995): Whole-genome random sequencing and assembly of haemophilus influenzae rd. Science, 269(5223), 496\u2013512.","journal-title":"Science"},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1142\/S0129626403001604","volume":"13","author":"N. Futamura","year":"2003","unstructured":"N. Futamura, S. Aluru, and X. Huang (2003): Parallel syntenic alignments. Parallel Processing Letters, 13, 689\u2013703.","journal-title":"Parallel Processing Letters"},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1093\/nar\/29.6.1272","volume":"29","author":"C. Gemund","year":"2001","unstructured":"C. Gemund, C. Ramu, B. A. Greulich, and T. J. Gibson (2001): Gene2EST: a BLAST2 server for searching expressed sequence tag (EST) databases with eukaryotic gene-sized queries. Nucleic Acids Research 29, 1272\u20131277.","journal-title":"Nucleic Acids Research"},{"key":"21_CR33","first-page":"331","volume":"19","author":"R. Giegerich","year":"1997","unstructured":"R. Giegerich and S. Kurtz (1997): From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. 19:331\u2013353.","journal-title":"From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction"},{"issue":"3","key":"21_CR34","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1093\/bioinformatics\/16.3.190","volume":"16","author":"O. Gotoh","year":"2000","unstructured":"O. Gotoh (2000): Homology-based gene structure prediction: simplified matching algorithm using a translated codon (tron) and improved accuracy by allowing for long gaps. Bioinformatics, 16(3), 190\u2013202.","journal-title":"Bioinformatics"},{"key":"21_CR35","unstructured":"P. Green (1996): <http:\/\/www.mbt.washington.edu\/phrap.docs\/phrap.html>."},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"R. Grossi and J.S. Vitter (2000): Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Symposium on the Theory of Computing, pp. 397\u2013406. ACM.","DOI":"10.1145\/335305.335351"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"D. Gusfield (1997): Algorithms on Strings Trees and Sequences. New York.","DOI":"10.1017\/CBO9780511574931"},{"key":"21_CR38","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01185430","volume":"12","author":"D. Gusfield","year":"1994","unstructured":"D. Gusfield, K. Balasubramaniam, and D. Naor (1994): Parametric optimization of sequence alignment. Algorithmica, 12, 312\u2013326.","journal-title":"Algorithmica"},{"issue":"11","key":"21_CR39","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0168-9525(00)02116-8","volume":"16","author":"S. A. Haas","year":"2000","unstructured":"S. A. Haas, T. Beissbarth, E. Rivals, A. Krause, and M. Vingron (2000): GeneNest: automated generation and visualization of gene indices. Trends in Genetics, 16(11), 521\u2013523.","journal-title":"Trends in Genetics"},{"issue":"1","key":"21_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"S. Hannenhalli and P.A. Pevzner (1999): Transorming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Journal of the Association for Computing Machinery, 46(1), 1\u201327.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"4","key":"21_CR41","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1101\/gr.2264004","volume":"14","author":"P. Havlak","year":"2004","unstructured":"P. Havlak, R. Chen, K.J. Durbin, A. Egan, Y.R. Ren, and X.Z. Song (2004): The Atlas genome assembly system. Genome Research, 14(4):721\u2013732.","journal-title":"Genome Research"},{"key":"21_CR42","doi-asserted-by":"crossref","first-page":"10915","DOI":"10.1073\/pnas.89.22.10915","volume":"89","author":"S. Henikoff","year":"1992","unstructured":"S. Henikoff and J.G. Henikoff (1992): Amino acid substitution matrices from protein blocks. Proc. National Academy of Sciences, 89, 10915\u201310919.","journal-title":"Proc. National Academy of Sciences"},{"issue":"6","key":"21_CR43","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"D.S. Hirschberg (1975): A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18(6), 341\u2013343.","journal-title":"Communications of the ACM"},{"issue":"3","key":"21_CR44","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01407900","volume":"18","author":"X. Huang","year":"1989","unstructured":"X. Huang (1989): A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor. International Journal of Parallel Programming, 18(3), 223\u2013239.","journal-title":"International Journal of Parallel Programming"},{"issue":"4","key":"21_CR45","first-page":"373","volume":"6","author":"X. Huang","year":"1990","unstructured":"X. Huang (1990): A space-efficient algorithm for local similarities. Computer Applications in the Biosciences, 6(4), 373\u2013381.","journal-title":"Computer Applications in the Biosciences"},{"key":"21_CR46","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/S0888-7543(05)80277-0","volume":"14","author":"X. Huang","year":"1992","unstructured":"X. Huang (1992): A contig assembly program based on sensitive detection of fragment overlaps. Genomics, 14, 18\u201325.","journal-title":"Genomics"},{"issue":"2","key":"21_CR47","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1093\/bioinformatics\/19.2.228","volume":"19","author":"X. Huang","year":"2003","unstructured":"X. Huang and K. Chao (2003): A generalized global alignment algorithm. Bioinformatics, 19(2), 228\u2013233.","journal-title":"Bioinformatics"},{"issue":"9","key":"21_CR48","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1101\/gr.9.9.868","volume":"9","author":"X. Huang","year":"1999","unstructured":"X. Huang and A. Madan (1999): CAP3: A DNA sequence assembly program. Genome Research, 9(9), 868\u2013877.","journal-title":"Genome Research"},{"issue":"6","key":"21_CR49","first-page":"497","volume":"12","author":"X. Huang","year":"1996","unstructured":"X. Huang and J. Zhang (1996): Methods for comparing a DNA sequence with a protein sequence. Computer Applications in Biosciences, 12(6), 497\u2013506.","journal-title":"Computer Applications in Biosciences"},{"key":"21_CR50","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1101\/gr.828403","volume":"13","author":"D.B. Jaffe","year":"2003","unstructured":"D.B. Jaffe, J. Butler, S. Gnerre, and E. Mauceli, et al. (2003): Whole-genome sequence assembly for mammalian genomes: ARACHNE2. Genome Research, 13, 91\u201396.","journal-title":"Genome Research"},{"key":"21_CR51","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1101\/gr.9.9.815","volume":"9","author":"N. Jareborg","year":"1999","unstructured":"N. Jareborg, E. Birney, and R. Durbin (1999): Comparative analysis of noncoding regions of 77 orthologous mouse and human gene pairs. Genome Research, 9, 815\u2013824.","journal-title":"Genome Research"},{"key":"21_CR52","doi-asserted-by":"crossref","unstructured":"A. Kalyanaraman, S. Aluru, V. Brendel, and S. Kothari (2003): Space and time efficient parallel algorithms and software for EST clustering. IEEE Transactions on Parallel and Distributed Systems, 14.","DOI":"10.1109\/TPDS.2003.1255634"},{"key":"21_CR53","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1101\/gr.155001","volume":"11","author":"Z. Kan","year":"2001","unstructured":"Z. Kan, E. C. Rouchka, W. R. Gish, and D. J. States (2001): Gene structure prediction and alternative splicing analysis using genomically aligned ESTs. Genome Research, 11, 889\u2013900.","journal-title":"Genome Research"},{"issue":"3","key":"21_CR54","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H. Kaplan","year":"2000","unstructured":"H. Kaplan, R. Shamir, and R.E. Tarjan (2000): A faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal on Computing, 29(3), 880\u2013892.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR55","doi-asserted-by":"crossref","unstructured":"J. K\u00e4rkk\u00e4inen and P. Sanders (2003): Simpler linear work suffix array construction. In International Colloquium on Automata, Languages and Programming, to appear.","DOI":"10.1007\/3-540-45061-0_73"},{"key":"21_CR56","doi-asserted-by":"crossref","unstructured":"R.M. Karp (2003): The role of algorithmic research in computational genomics. In Proc. IEEE Computational Systems Bioinformatics, pp. 10\u201311. IEEE.","DOI":"10.1109\/CSB.2003.1227288"},{"issue":"1\u20132","key":"21_CR57","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01188580","volume":"13","author":"J. Kececioglu","year":"1995","unstructured":"J. Kececioglu and E. Myers (1995): Combinatorial algorithms for DNA sequence assembly. Algorithmica, 13(1\u20132), 7\u201351.","journal-title":"Algorithmica"},{"key":"21_CR58","doi-asserted-by":"crossref","unstructured":"P. Ko and S. Aluru (2003): Space-efficient linear-time construction of suffix arrays. In 14th Annual Symposium, Combinatorial Pattern Matching.","DOI":"10.1007\/3-540-44888-8_15"},{"key":"21_CR59","unstructured":"P. Ko, M. Narayanan, A. Kalyanaraman, and S. Aluru (2004): Space conserving optimal DNA-protein alignment. In Proc. IEEE Computational Systems Bioinformatics, pp. 80\u201388."},{"key":"21_CR60","doi-asserted-by":"crossref","unstructured":"A. Krause, S. A. Haas, E. Coward, and M. Vingron (2002): SYSTERS, GeneNest, SpliceNest: Exploring sequence space from genome to protein. Nucleic Acids Research, 30.","DOI":"10.1093\/nar\/30.1.299"},{"key":"21_CR61","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1093\/nar\/28.1.270","volume":"28","author":"A. Krause","year":"2000","unstructured":"A. Krause, J. Stoye, and M. Vingron (2000): The SYSTERS protein sequence cluster set. Nucleic Acids Research, 28, 270\u2013272.","journal-title":"Nucleic Acids Research"},{"key":"21_CR62","unstructured":"E. Lander, J.P. Mesirov, and W. Taylor (1988): Protein sequence comparison on a data parallel computer. In Proc. International Conference on Parallel Processing, pp. 257\u2013263."},{"key":"21_CR63","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0888-7543(88)90007-9","volume":"2","author":"E.S. Lander","year":"1988","unstructured":"E.S. Lander and M.S. Waterman (1988): Genomic mapping by fingerprinting random clones: a mathematical analysis. Genomics, 2, 231\u2013239.","journal-title":"Genomics"},{"issue":"18","key":"21_CR64","doi-asserted-by":"publisher","first-page":"3657","DOI":"10.1093\/nar\/28.18.3657","volume":"28","author":"F. Liang","year":"2000","unstructured":"F. Liang, I. Holt, G. Pertea, S. Karamycheva, S. Salzberg, and J. Quackenbush (2000): An optimized protocol for analysis of EST sequences. Nucleic Acids Research, 28(18), 3657\u20133665.","journal-title":"Nucleic Acids Research"},{"key":"21_CR65","volume-title":"Molecular Cell Biology","author":"H.F. Lodish","year":"2003","unstructured":"H.F. Lodish, A. Berk, P. Matsudaira, C.A. Kaiser, M. Krieger, M.P. Scott, S.L. Zipursky, and J. Darnell (2003): Molecular Cell Biology. W.H. Freeman and Company, New York, NY."},{"key":"21_CR66","doi-asserted-by":"crossref","first-page":"9061","DOI":"10.1073\/pnas.93.17.9061","volume":"93","author":"P. A. Pevzner","year":"1996","unstructured":"P. A. Pevzner M. S. Gelfand, and A. Mironov (1996): Gene recognition via spliced alignment. Proc. National Academy of Sciences, 93, 9061\u20139066.","journal-title":"Proc. National Academy of Sciences"},{"key":"21_CR67","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and G. Myers (1993): Suffix arrays: a new method for on-line search. SIAM Journal on Computing, 22, 935\u201348.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR68","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"W.J. Masek and M.S. Paterson (1980): A faster algorithm for computing string edit distances. Journal of Computer and System Sciences, 20, 18\u201331.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR69","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight (1976): A space-economical suffix tree construction algorithm. Journal of the ACM, 23, 262\u201372.","journal-title":"Journal of the ACM"},{"key":"21_CR70","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1038\/ng0102-13","volume":"30","author":"B. Modrek","year":"2002","unstructured":"B. Modrek and C. Lee (2002): A genomic view of alternative splicing. Nature Genetics, 30, 13\u201319.","journal-title":"Nature Genetics"},{"key":"21_CR71","unstructured":"D.W. Mount (2001): Bioinformatics: Sequence and Genome Analysis. Cold Spring Harbor Laboratory."},{"key":"21_CR72","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1101\/gr.731003","volume":"13","author":"J.C. Mullikin","year":"2003","unstructured":"J.C. Mullikin and Z. Ning (2003): The phusion assembler. Genome Research, 13, 81\u201390.","journal-title":"Genome Research"},{"key":"21_CR73","doi-asserted-by":"crossref","unstructured":"E. Myers (1994): Advances in Sequence Assembly, chapter in Automated DNA Sequencing and Analysis Techniques (C. Ventner, ed), pp. 231\u2013238. Academic Press Limited.","DOI":"10.1016\/B978-0-08-092639-1.50036-8"},{"issue":"2","key":"21_CR74","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1089\/cmb.1995.2.275","volume":"2","author":"E.W. Myers","year":"1995","unstructured":"E.W. Myers (1995): Toward simplifying and accurately formulating fragment assembly. Journal of Computational Biology, 2(2), 275\u2013290.","journal-title":"Journal of Computational Biology"},{"issue":"5461","key":"21_CR75","doi-asserted-by":"publisher","first-page":"2196","DOI":"10.1126\/science.287.5461.2196","volume":"287","author":"E.W. Myers","year":"2000","unstructured":"E.W. Myers, G.G. Sutton, A.L. Delcher, I.M. Dew, et al. (2000): A whole genome assembly of drosophila. Science, 287(5461), 2196\u20132204.","journal-title":"Science"},{"issue":"1","key":"21_CR76","first-page":"11","volume":"4","author":"E.W. Myers","year":"1988","unstructured":"E.W. Myers and W. Miller (1988): Optimal alignments in linear space. Computer Applications in the Biosciences, 4(1), 11\u201317.","journal-title":"Computer Applications in the Biosciences"},{"key":"21_CR77","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"S.B. Needleman and C.D. Wunsch (1970): A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48, 443\u2013453.","journal-title":"Journal of Molecular Biology"},{"key":"21_CR78","doi-asserted-by":"crossref","unstructured":"L. Patcher and B. Strumfels (2004): Parametric inference for biological sequence analysis. Proc. National Academy of Sciences, to appear.","DOI":"10.1073\/pnas.0406011101"},{"key":"21_CR79","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/nar\/12.1Part1.307","volume":"12","author":"H. Peltola","year":"1984","unstructured":"H. Peltola, H. Soderlund, and E. Ukkonen (1984): SEQAID: a DNA sequence assembly program based on a mathematical model. Nucleic Acids Research, 12, 307\u2013321.","journal-title":"Nucleic Acids Research"},{"key":"21_CR80","doi-asserted-by":"crossref","unstructured":"P. Pevzner and G. Tesler (2003): Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisted. In Proc. International Conference on Research in Computational Molecular Biology (RECOMB), pp. 247\u2013256. ACM.","DOI":"10.1145\/640075.640108"},{"key":"21_CR81","doi-asserted-by":"crossref","unstructured":"P.A. Pevzner (2000): Computational Molecular Biology: An Algorithmic Approach. MIT Press.","DOI":"10.7551\/mitpress\/2022.001.0001"},{"key":"21_CR82","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/nar\/29.1.159","volume":"29","author":"J. Quackenbush","year":"2001","unstructured":"J. Quackenbush, J. Cho, D. Lee, F. Liang, I. Holt, S. Karamycheva, B. Parvizi, G. Pertea, R. Sultana, and J. White (2001): The TIGR gene indices: analysis of gene transcript sequences in highly sampled eukaryotic species. Nucleic Acids Research, 29, 159\u2013164.","journal-title":"Nucleic Acids Research"},{"key":"21_CR83","doi-asserted-by":"crossref","unstructured":"S. Rajko and S. Aluru (2004): Space and time optimal parallel sequence alignments. IEEE Transactions on Parallel and Distributed Systems, 15(11).","DOI":"10.1109\/TPDS.2004.86"},{"key":"21_CR84","doi-asserted-by":"crossref","first-page":"5463","DOI":"10.1073\/pnas.74.12.5463","volume":"74","author":"F. Sanger","year":"1977","unstructured":"F. Sanger, S. Nicklen, and A.R. Coulson (1977): DNA sequencing with charinterminating inhibitors. Proc. National Academy of Sciences, 74, 5463\u20135467.","journal-title":"Proc. National Academy of Sciences"},{"key":"21_CR85","unstructured":"D. Sankoff and J.B. Kruskal (1983): Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison. Reading, MA."},{"key":"21_CR86","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1101\/gr.10.4.577","volume":"10","author":"S. Schwartz","year":"2000","unstructured":"S. Schwartz, Z. Zhang, K. Frazer, A. Smit, C. Riemer, J. Bouck, R. Gibbs, R. Hardison, and W. Miller (2000): PipMaker-a web server for aligning two genomic DNA sequences. Genome Research, 10, 577\u2013586.","journal-title":"Genome Research"},{"key":"21_CR87","volume-title":"Introduction to Computational Molecular Biology","author":"J. Setubal","year":"1997","unstructured":"J. Setubal and J. Meidanis (1997): Introduction to Computational Molecular Biology. PWS Publishing Company, Boston, MA."},{"key":"21_CR88","unstructured":"A. Smit and P. Green (1999): http:\/\/ftp.genome.washington.edu\/RM\/Repeat Masker.html, 1999."},{"key":"21_CR89","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"T.F. Smith and M.S. Waterman (1981): Identification of common molecular subsequences. Journal of Molecular Biology, 147, 195\u2013197.","journal-title":"Journal of Molecular Biology"},{"key":"21_CR90","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S1046-2023(05)80165-3","volume":"3","author":"D.J. States","year":"1991","unstructured":"D.J. States, W. Gish, and S.F. Altschul (1991): Improved sensitivity of nucleic acid database searches using application-specific scoring matrices. Methods, 3, 66\u201370.","journal-title":"Methods"},{"key":"21_CR91","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1089\/gst.1995.1.9","volume":"1","author":"G. Sutton","year":"1995","unstructured":"G. Sutton, O. White, M. Adams, and A. Kerlavage (1995): TIGR assembler: A new tool for asembling large shotgun sequencing projects. Genome Science and Technology, 1, 9\u201319.","journal-title":"Genome Science and Technology"},{"issue":"2","key":"21_CR92","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan (1975): Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2), 215\u2013225.","journal-title":"Journal of the ACM"},{"key":"21_CR93","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"G. Tesler (2002): Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences, 65, 587\u2013609.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR94","first-page":"249","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"E. Ukkonen (1995): On-line construction of suffix-trees. 14, 249\u201360.","journal-title":"On-line construction of suffix-trees"},{"issue":"5507","key":"21_CR95","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1126\/science.1058040","volume":"291","author":"J.C. Venter","year":"2001","unstructured":"J.C. Venter, M.D. Adams, E.W. Myers, P.W. Li, et al. (2001): The sequence of the human genome. Science, 291(5507), 1304\u20131351.","journal-title":"Science"},{"key":"21_CR96","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-6846-3","volume-title":"Introduction to Computational Biology: Maps, Sequences and Genomes","author":"M.S. Waterman","year":"1995","unstructured":"M.S. Waterman (1995): Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman and Hall, London."},{"key":"21_CR97","doi-asserted-by":"crossref","unstructured":"P. Weiner (1973): Linear pattern matching algorithms. In 14th Symposium on Switching and Automata Theory, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"key":"21_CR98","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1101\/gr.175701","volume":"11","author":"R. Yeh","year":"2001","unstructured":"R. Yeh, L. P. Lim, and C. B. Burge (2001): Computational inference of homologous gene structures in the human genome. Genome Research, 11, 803\u2013816.","journal-title":"Genome Research"},{"key":"21_CR99","doi-asserted-by":"crossref","unstructured":"Z. Zhang, W. R. Pearson, and W. Miller (1997): Aligning a DNA sequence with a protein sequence. Journal of Computational Biology, pp. 339\u201349.","DOI":"10.1145\/267521.267893"}],"container-title":["Handbook of Nature-Inspired and Innovative Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-27705-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T03:29:13Z","timestamp":1736306953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-27705-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387405321"],"references-count":99,"URL":"https:\/\/doi.org\/10.1007\/0-387-27705-6_21","relation":{},"subject":[]}}