LILA KARI
Professor & Canada Research Chair in Biocomputing
Department of Computer Science
University of Western Ontario
London, Ontario Canada N6A 5B7
Tel: +1 519 661 2111 ext. 86894
Fax: +1 519 661 3515
Email: lila "at" csd.uwo.ca

Cross-appointed in the Department of Biochemistry, Schulich School of Medicine and Dentistry

NEW

"The Many Facets of Natural Computing" (L.Kari, G.Rozenberg): Cover Story of
Communications of the ACM, Oct.2008, vol.51, no.10, 72-83 (review article)

Research interests

Awards

Media

Biocomputing Laboratory

* University of Western Ontario BIOCOMPUTING STUDENT AWARD

Research and Scholarly Contributions

Selected publications (full bibliographical info available here )

    * L.Adleman, J.Kari, L.Kari, D.Reishus, P.Sosik, The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM J. Comput. Volume 38, Issue 6, pp. 2356-2381 (2009) (pdf)
    * L.Kari, G.Rozenberg. The many facets of natural computing. Communications of the ACM, Oct.2008, vol.51, no.10, 72-83 (pdf file of the paper with no pictures but with enhanced reference list) . See top of page for the published version.
    * E.Czeizler, E.Czeizler, L.Kari, S.Seki. An extension of Lyndon-Schutzenberger's result to pseudoperiodic words. Submitted. Also, UWO Technical Reports TR-722, 2009, ISBN:978-0-7714-2699-5 pdf
    * E.Czeizler, L.Kari, S.Seki. On a Special Class of Primitive Words. MFCS 2008: 265-277 pdf
    * M. Ito, L. Kari, Z. Kincaid, S. Seki, Duplication in DNA sequences. Proc. of Developments in Language Theory, 2008, 419-430. pdf
    * L. Kari, S. Seki, On pseudoknot-bordered words and their properties, Journal of Computer and System Sciences, 75 (2009) 113-121. pdf
    * L. Kari, K. Mahalingam, S. Seki, Twin-roots of words and their properties, Theoretical Computer Science, in press. pdf
    * L.Kari, K.Mahalingam, Involutively bordered words, International Journal of Foundations of Computer Science, 2008, in press. pdf
    * L.Kari, K.Mahalingam, Watson-Crick Conjugate and Commutative Words, Proc. DNA13, LNCS 4848 (2008) 273-283. pdf
    * L. Kari, S. Konstantinidis, P. Sosík: Bond-free Languages: Formalizations, Maximality and Construction Methods. International Journal of Foundations of Computer Science 16 (2005), 1039--1070. pdf
    * L. Kari, S. Konstantinidis: Language Equations, Maximality and Error-detection. J. of Computer and System Sciences 70 (2005), 157-178. pdf
    * L. Kari, S. Konstantinidis, P. Sosík: Bond-free Languages: Formalizations, Maximality and Construction Methods. Proc. DNA 10, LNCS 3384 (2005), 169-181. (Best Paper Score.) pdf
    * L.Adleman, J.Kari, L.Kari, D.Reishus. On the decidability of self-assembly of infinite ribbons. Proc. FOCS 2002, 530-537. pdf
    * L.Kari, L.F.Landweber. Computational power of gene rearrangement. Proc. DNA 5, DIMACS Series, 54(2000), 207-216 pdf , ps
    * L.Kari, J.Kari, L.F.Landweber. Reversible molecular computation in ciliates. In "Jewels are Forever", Springer-Verlag 1999, 353-363. pdf , ps
    * L.Landweber, L.Kari. The evolution of cellular computing: nature's solution to a computational problem. Biosystems 52(1999) 3-13. (link here)
    * L.Kari. DNA computing -- The arrival of biological mathematics. The Mathematical Intelligencer, 19(1997), 9--22. pdf

DNA computing

Teaching