¡£13. Megjegyzések a fejezetheznáció, a pedigré elemzés, a karakteralapú törzsfakészítő módszerek, a részleges emésztés,a fehérjecsavarás, DNS chipek, a tudásábrázolás, a biokémiai hálózatok. Ennek fényébenDonald Knuth szavaival [9] zárjuk könyvfejezetünket: ”It is hard for me to say confidentlythat, after fifty more years of explosive growth of computer science, there will still be a lotof fascinating unsolved problems at peoples’ fingertips, that it won’t be pretty much workingon refinements of well-explored things. Maybe all of the simple stuff and the reallygreat stuff has been discovered. It may not be true, but I can’t predict an unending growth. Ican’t be as confident about computer science as I can about biology. Biology easily has 500years of exciting problems to work on, it’s at that level.”
¡Wl§¡ ©£¢.§¥¤§¦©¨©[1] L. Addario-Berry, B. Chor, M. Hallett, J. Lagergren, A. Panconesi, T. Wareham. Ancestral maximum likelihoodof phylogenetic trees is hard. Lecture Notes in Bioinformatics, 2812:202–215, 2003. 585[2] T. Akutsu. Dynamic programming algorithms for RNA secondary prediction with pseudoknots. DiscreteApplied Mathematics, 104:45–62, 2000. 586[3] E. Althaus, A. Caprara, H. Lenhof, K. Reinert. Multiple sequence alignment with arbitrary gap costs: Computingan optimal solution using polyhedral combinatorics. Bioinformatics, 18:S4–S16, 2002. 584[4] V. Arlazanovan. A. Dinic, M. Kronrod, I. Faradzev. On economic construction of the transitive closure of adirected graph. Doklady Academii Nauk SSSR, 194:487–488, 1970. 584[5] K. Atteson. The performance of the neighbor-joining method of phylogeny reconstruction. Algorithmica,25(2/3):251–278, 1999. 586[6] I. Bach. Formális nyelvek (Formal languages). Typotex, 2001. 584[7] D. Christie. Sorting permutations by block-interchanges. Information Processing Letters, 60(4):165–169,1996. 586[8] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein. Introduction to Algorithms. The MIT Press/McGraw-Hill, 2003 (Második kiadás negyedik, javított utánnyomása. Magyarul: Új <strong>algoritmusok</strong>. Scolar Kiadó, 2003).584[9] D.. Doernberg. Interview with Donald Knuth. Computer Literacy, 1993. 587[10] R. Durbin, S. Eddy, A. Krogh, G. Mitchison. Biological Sequence Analysis. University Press, 1998. 584[11] P. Erdős, M. Steel, L. Székely, T. Warnow. Local quartet splits of a binary tree infer all quartet splits via onedyadic inference rule. Computers and Artificial Intelligence, 16(2):217–227, 1997. 586[12] J. Felsenstein. Inferring Phylogenies. Sinauer Associates, Inc., 2003. 584[13] Z. Fülöp. Formális nyelvek és szintaktikus elemzésük (Formal Languages and their Syntactical Analysis).Polygon, 2000. 584[14] W. H. Gates, C. Papadimitriou. Bounds for sorting by prefix reversals. Discrete Mathematics, 27:47–57,1979. 586[15] N. Goldman, J. Thorne, D. Jones. Using evolutionary trees in protein secondary structure prediction andother comparative sequence analyses. Journal of Molecular Biology, 263(2):196–208, 1996. 585[16] O. Gotoh. An improved algorithm for matching biological sequences. Journal of Molecular Biology,162:705–708, 1982. 583[17] D. M. Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge University Press, 1997. 583, 584[18] S. Hannenhalli. Polynomial-time algorithm for computing translocation distance between genomes. DiscreteApplied Mathematics, 71:137–151, 1996. 586[19] M. Höchsman, T. Töller, R. Giegerich, S. Kurtz. Local similarity in RNA secondary structure. In Proceedingsof IEEE Bioinformatics Conference 2003, 159–168. o., 2003. 586[20] D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communicationsof the ACM, 18:341–343, 1975. 584[21] R. Hughey, A. Krogh. Hidden markov models for sequence analysis: Extension and analysis of the basicmethod. CABIOS, 12(2):95–107, 1996. 585[22] J. Hunt, T. Szymanski. A fast algorithm for computing longest common subsequences. Communications ofthe ACM, 20(5):350–353, 1977. 584