Lila Kari | Academic Influence

Lila Kari's AcademicInfluence.com Rankings

Lila Kari

Computer Science

#3223

World Rank

#3376

Historical Rank

Theoretical Computer Science

#124

World Rank

#124

Historical Rank

Database

#7819

World Rank

#8133

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Lila Kari's Degrees

PhD Computer Science University of Bucharest
Masters Computer Science University of Bucharest
Bachelors Mathematics University of Bucharest

Similar Degrees You Can Earn

Why Is Lila Kari Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Lila Kari is a Romanian and Canadian computer scientist, professor in the David R. Cheriton School of Computer Science at the University of Waterloo, Canada. Biography Professor Kari earned a master's degree at the University of Bucharest in 1987, studying there with Gheorghe Păun, and then moved to the University of Turku in Finland for her graduate studies, earning a Ph.D. in 1991 under the supervision of Arto Salomaa. She came to the University of Western Ontario as a visiting professor in 1993, and by 1996 had been hired there as a tenure-track faculty member. In 2017 she accepted a position of professor of computer science and University Research Chair at the University of Waterloo.

(See a Problem?)

Lila Kari's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Machine learning using intrinsic genomic signatures for rapid classification of novel pathogens: COVID-19 case study (2020) (465)
The many facets of natural computing (2008) (244)
The evolution of cellular computing: nature's solution to a computational problem. (1999) (162)
Computationally universal P systems without priorities: two catalysts are sufficient (2005) (142)
Contextual Insertions/Deletions and Computability (1996) (133)
Secret ballot elections in computer networks (1991) (125)
DNA computing, sticker systems, and universality (1998) (120)
The spectrum of genomic signatures: from dinucleotides to chaos game representation. (2005) (113)
Theory of Evolutionary Computation: Recent Developments in Discrete Optimization (2020) (111)
On Insertion and Deletion in Formal Languages (1991) (101)
Test Tube Distributed Systems Based on Splicing (1996) (95)
DNA Computing Based on Splicing: The Existence of Universal Computers (1999) (93)
Universal Molecular Computation in Ciliates (2002) (83)
L Systems (1974) (83)
Coding properties of DNA languages (2001) (82)
On Language Equations with Invertible Operations (1994) (69)
An open-source k-mer based machine learning tool for fast and accurate subtyping of HIV-1 genomes (2018) (60)
Computational power of gene rearrangement (1999) (53)
On the decidability of self-assembly of infinite ribbons (2002) (52)
On a special class of primitive words (2008) (51)
Watson-Crick Conjugate and Commutative Words (2007) (48)
Watson–Crick palindromes in DNA computing (2010) (47)
Using DNA to solve the Bounded Post Correspondence Problem (2000) (47)
Circular contextual insertions/deletions with applications to biomolecular computation (1999) (45)
Sticky-free and overhang-free DNA languages (2003) (45)
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems (1997) (43)
Negative Interactions in Irreversible Self-assembly (2010) (41)
Codes, Involutions, and DNA Encodings (2002) (40)
ML-DSP: Machine Learning with Digital Signal Processing for ultrafast, accurate, and scalable genome classification at all taxonomic levels (2018) (36)
The power of nondeterminism in self-assembly (2010) (35)
On properties of bond-free DNA languages (2005) (35)
Shuffle and scattered deletion closure of languages (2000) (33)
Hairpin Structures in DNA Words (2005) (33)
Secret Selling of Secrets with Several Buyers (1990) (32)
On the descriptional complexity of Watson-Crick automata (2009) (32)
Insertion and Deletion Closure of Languages (1997) (31)
Bond-Free Languages: Formalizations, Maximality and Construction Methods (2004) (31)
Closure and decidability properties of some language classes with respect to ciliate bio-operations (2003) (30)
Mapping the Space of Genomic Signatures (2014) (28)
On Hairpin-Free Words and Languages (2005) (28)
Teams in cooperating grammar systems (1995) (28)
Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement (2010) (27)
Involutively Bordered Words (2007) (27)
Reversible Molecular Computation in Ciliates (1999) (26)
On the weight of universal insertion grammars (2008) (26)
Aspects of shuffle and deletion on trajectories (2005) (25)
Descriptional Complexity of Error/Edit Systems (2004) (24)
DNA Computing: Models and Implementations (2002) (24)
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (2009) (24)
DNA Computing - Foundations and Implications (2012) (23)
Maximal and Minimal Solutions to Language Equations (1996) (23)
State complexity of combined operations with two basic operations (2012) (23)
An investigation into inter- and intragenomic variations of graphic genomic signatures (2015) (22)
Some Properties of Ciliate Bio-operations (2002) (21)
Towards a DNA solution to the shortest common superstring problem (1998) (20)
Subapical Bracketed L-Systems (1994) (20)
K-Comma Codes and Their Generalizations (2011) (20)
Additive methods for genomic signatures (2016) (19)
From Micro-Soft to Bio-Soft: Computing With DNA (1997) (19)
A Formal Language Analysis of DNA Hairpin Structures (2006) (19)
DNA Codes and Their Properties (2006) (19)
An extension of the Lyndon-Schützenberger result to pseudoperiodic words (2011) (19)
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems (1993) (19)
Multi-Pattern Languages (1995) (18)
State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection (2011) (18)
Further remarks on parallel communicating grammar systems (1990) (18)
The syntactic monoid of hairpin-free languages (2007) (18)
Language equations, maximality and error-detection (2005) (18)
On the Universality of P Systems with Minimal Symport/Antiport Rules (2004) (18)
K-catenation and applications: k-prefix codes (1995) (18)
Binary Pattern Tile Set Synthesis Is NP-Hard (2014) (18)
One-reversal counter machines and multihead automata: Revisited (2011) (17)
Families of languages defined by ciliate bio-operations (2004) (17)
Two Lower Bounds on Distributive Generation of Languages (1994) (16)
Pseudopower Avoidance (2012) (16)
Generalized Derivatives (1993) (16)
On the overlap assembly of strings and languages (2017) (16)
Deletion Sets (1993) (16)
Machine learning-based analysis of genomes suggests associations between Wuhan 2019-nCoV and bat Betacoronaviruses (2020) (16)
Deletion operations: closure properties (1994) (15)
On pseudoknot-bordered words and their properties (2009) (15)
On Parallel Deletions Applied to a Word (1995) (14)
DNA computing in vitro and in vivo (2001) (14)
Morphisms preserving densities (2001) (13)
Finite-state error/edit-systems and difference-measures for languages and words (2003) (13)
An Improved Bound for an Extension of Fine and Wilf's Theorem and Its Optimality (2010) (13)
Insertion and Deletion of Words: Determinism and Reversibility (1992) (13)
Preventing Undesirable Bonds Between DNA Codewords (2004) (12)
Properties of Pseudo-Primitive Words and their Applications (2010) (12)
The Impact of the Number of Cooperating Grammars on the Generative Power (1992) (12)
Triangular and Hexagonal Tile Self-assembly Systems (2012) (12)
Deciding whether a regular language is generated by a splicing system (2011) (12)
State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal (2012) (11)
A computer scientist's guide to molecular biology (2001) (10)
Further remarks on DNA overlap assembly (2017) (10)
Involution Solid and Join codes (2006) (10)
A Formal Language Model of DNA Polymerase Enzymatic Activity (2015) (9)
How to Compute with DNA (1999) (9)
Word insertions and primitivity ∗ (1998) (9)
MLDSP-GUI: An alignment-free standalone tool with an interactive graphical user interface for DNA sequence comparison and analysis. (2019) (9)
MLDSP-GUI: An alignment-free standalone tool with an interactive graphical user interface for DNA sequence comparison and analysis (2019) (9)
DeLUCS: Deep learning for unsupervised clustering of DNA sequences (2021) (8)
Computing the Hamming Distance of a Regular Language in Quadratic Time (2004) (8)
DNA Computers: Tomorrow's Reality (2001) (8)
3-color bounded patterned self-assembly (2013) (8)
Schema for Parallel Insertion and Deletion (2010) (8)
The Power of Restricted Splicing with Rules from a Regular Language (1996) (8)
Computing with DNA. (2000) (8)
The LD and DLAD Bio-Operations on Formal Languages (2003) (8)
State complexity of union and intersection of star on k regular languages (2012) (7)
Watson-Crick automata: determinism and state complexity (2008) (7)
State Complexity of Overlap Assembly (2017) (7)
State Complexity of Catenation Combined with Star and Reversal (2010) (7)
DNA Computing and Errors: A Computer Science Perspective (2005) (7)
Power of Controlled Insertion and Deletion (1994) (7)
State Complexity of Catenation Combined with Union and Intersection (2010) (7)
De Bruijn Sequences Revisited (2012) (6)
Results on Transforming NFA into DFCA (2004) (6)
Codes, Involutions and Dna Encoding (2007) (6)
Watson-Crick Bordered Words and their Syntactic Monoid (2008) (6)
Schema for Parallel Insertion and Deletion: Revisited (2011) (6)
State complexity of union and intersection of square and reversal on k regular languages (2012) (6)
MoDMaps3D: an interactive webtool for the quantification and 3D visualization of interrelationships in a dataset of DNA sequences (2017) (6)
State complexity of star of union and square of union on k regular languages (2013) (5)
Static and dynamic properties of DNA languages (2003) (5)
Block Substitutions and Their Properties (2006) (5)
An efficient algorithm for computing the edit distance of a regular language via input-altering transducers (2014) (5)
Iterated Hairpin Completions of Non-crossing Words (2011) (5)
Computational modeling of genetic processes in stichotrichous ciliates (2003) (5)
Twin-roots of words and their properties (2009) (5)
Substitutions, Trajectories and Noisy Channels (2004) (5)
Context-free recombinations (2001) (5)
Duplication in DNA Sequences (2008) (5)
Insertion operations: Closure properties (1993) (5)
State Complexity of Simple Splicing (2019) (4)
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems (2015) (4)
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words (2009) (4)
DNA Computing, Matching Systems, and Universality (1996) (4)
Block insertion and deletion on trajectories (2011) (4)
Languages and compatible relations on monoids ∗ (2010) (4)
Predicate Calculus (2009) (4)
Operations on trajectories with applications to coding and bioinformatics (2005) (4)
State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation (2010) (4)
On the maximality of languages with combined types of code properties (2014) (4)
On Language Equations with Deletion (2004) (3)
Who counts your votes? [VEV electronic voting system] (2005) (3)
Generating the Pseudo-Powers of a Word (2014) (3)
On a theorem of Günter Asser (1990) (3)
Bringing PC Grammar Systems Closer to Hoare's CSPs (1999) (3)
Triangular Tile Self-assembly Systems (2010) (3)
DNA computing based on insertions and deletions (2010) (3)
As good as it gets: a scaling comparison of DNA computing, network biocomputing, and electronic computing approaches to an NP-complete problem (2021) (3)
DNA computing: a research snapshot (2010) (3)
On the Regularity of Iterated Hairpin Completion of a Single Word (2011) (3)
Word Blending in Formal Languages: The Brangelina Effect (2018) (2)
K − insertion and k − deletion closure of languages (1995) (2)
Geometrical Tile Design for Complex Neighborhoods (2009) (2)
ML-DSP: Machine Learning with Digital Signal Processing for ultrafast, accurate, and scalable genome classification at all taxonomic levels (2019) (2)
Building bridges - Honoring Nataša Jonoska on the occasion of her 60th birthday (2021) (2)
Map of Life: Measuring and Visualizing Species' Relatedness with "Molecular Distance Maps" (2013) (2)
Pseudo-power Avoidance (2009) (2)
3-Color Bounded Patterned Self-assembly - (Extended Abstract) (2013) (2)
Pseudo-Identities and Bordered Words (2014) (2)
Disjunctivity and other properties of sets of pseudo-bordered words (2017) (2)
State Complexity of Star and Square of Union of k Regular Languages (2012) (2)
Morphisms and Associated Congruences (1995) (2)
Substitution on Trajectories (2004) (1)
In the Prehistory of Formal Languages : Gauss Languages ? (2019) (1)
Biocomputation in Ciliates (2004) (1)
On the pseudo-commutativity of words and languages ? (2007) (1)
Parallel Communicating Grammar Systems (1993) (1)
On pseudoknot words and their properties ? (2007) (1)
Negative Interactions in Irreversible Self-assembly (2012) (1)
Hypergraph Automata: a Theoretical Model for patterned Self-assembly (2013) (1)
3-color bounded patterned self-assembly (2014) (1)
Word Blending in Formal Languages (2019) (1)
Insertion and Deletion for Involution Codes (2005) (1)
Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies (2011) (1)
Unconventional Computation and Natural Computation (2014) (1)
Descriptional Complexity of Semi-simple Splicing Systems (2019) (1)
Involution Solid Codes (2006) (1)
Generalised DOL Trees (1995) (1)
k-involution codes and related sets (2007) (1)
Deciding if a Regular Language is Generated by a Splicing System (2011) (1)
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes (2009) (1)
Binary Pattern Tile Set Synthesis Is NP-Hard (2016) (1)
Languages and monoids with disjunctive identity (1995) (1)
Parallel Communicating Systems (1990) (1)
In the prehistory of formal language theory: Gauss Languages (1992) (1)
Smart Tile Self-Assembly and Replication (2017) (1)
Editorial (2019) (0)
Descriptional Complexity of SemiSimple Splicing Systems (2019) (0)
Editorial (2016) (0)
Orthogonal Shuffle on Trajectories (2011) (0)
Editorial (2016) (0)
Editorial (2022) (0)
Editorial (2020) (0)
Triangular Self-Assembly (2010) (0)
Subapical Bracketed L-systems Subapical Bracketed L-systems (1996) (0)
Preface (2020) (0)
Triangular and Hexagonal Tile Self-Assembly Systems Triangular and Hexagonal Tile Self-Assembly Systems (2010) (0)
Gramars with Oracles (1993) (0)
MT-MAG: Accurate and interpretable machine learning for complete or partial taxonomic assignments of metagenome-assembled genomes (2022) (0)
Editorial (2021) (0)
Half century of automata theory (2000) (0)
Primitivity of Atom Watson-Crick Fibonacci Words (2022) (0)
Generalized DOL trees * (2010) (0)
Towards the Sequence Design Preventing Pseudoknot Formation (2007) (0)
Editorial (2019) (0)
DNA Overlap Catenation by XPCR: A Theoretical Analysis (2015) (0)
Editorial (2022) (0)
Towards a Solution for the Shortest CommonSuperstring Problem (2007) (0)
Invertible insertion and deletion operations (2010) (0)
Negative Glues and Non-determinism in Nanocomputations by Self-assembly (2013) (0)
Simplifying the role of signals in tile self-assembly (2018) (0)
Watson-Crick Powers of a Word (2022) (0)
Aperiodic Languages and Generalizations (1994) (0)
A fascinating rainbow of computation - Honoring Gheorghe Păun on the occasion of his 70th birthday (2021) (0)
Editorial (2015) (0)
Editorial (2023) (0)
Editorial (2015) (0)
A Hierarchy of Unary Primitive Recursive String-Functions (1990) (0)
TCS in the 21st century (2015) (0)
Editorial (2015) (0)
Disjunctivity and other properties of sets of pseudo-bordered words (2016) (0)
Editorial (2018) (0)
Editorial (2021) (0)
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers (2018) (0)
Simplifying the role of signals in tile self-assembly (2019) (0)
Preface (2015) (0)
Ciliate Gene Unscrambling with Fewer Templates (2010) (0)
Micromycetes from Finnish Lapland. (1936) (0)
Methods for Relativizing Properties of Codes (2015) (0)
Editorial (2018) (0)
SUBAPICAL L-SYSTEMS (1995) (0)
Editorial (2021) (0)
Editorial (2021) (0)
Polyominoes simulating arbitrary-neighborhood zippers and tilings (2010) (0)
Editorial (2016) (0)
Editorial (1991) (0)
Editorial (2020) (0)
On the overlap assembly of strings and languages (2016) (0)
String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation (2001) (0)
Natural computing builds a bridge between computer science and natural sciences (2008) (0)
DNA Computing and Its Implications for Theoretical Computer Science (2010) (0)
Preface (2019) (0)
Relative Watson-Crick Primitivity of Words (2018) (0)
Nanocomputing by Self-assembly (2007) (0)
Unconventional computation and natural computation : 13th international conference, UCNC 2014, London, ON, Canada, July 14-18, 2014 : proceedings (2014) (0)
Editorial (2001) (0)
Semi-Commutativity Sets of Morphisms over Finitely Generated Free Monoids 1 (2010) (0)
CHAPTER 2 PARALLEL COMMUNICATING GRAMMAR SYSTEMS Bringing PC Grammar Systems Closer to Hoare ’ s CSP ’ s 1 (2011) (0)
Editorial (2021) (0)
Editorial (2020) (0)
Additive methods for genomic signatures (2016) (0)
At the Crossroads of Linguistics , DNA Computing , and Formal Language Theory : Characterizing RE Using Insertion-Deletion Systems 1 (2007) (0)
Who Counts Your Votes? (2016) (0)
Editorial (2021) (0)
Mutational patterns observed in SARS-CoV-2 genomes sampled from successive epochs delimited by major public health events in Ontario, Canada: A genomic surveillance study (Preprint) (2022) (0)
Organizing Commitee (2019) (0)
Editorial (2016) (0)
Biocomputing: an application for micro-arrays? (2001) (0)
MT-MAG: Accurate and interpretable machine learning based taxonomic assignment of metagenome-assembled genomes, with a partial classification option (2022) (0)
Editorial (2021) (0)
Editorial (2021) (0)
Editorial (2020) (0)
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) (2011) (0)
Editorial (2020) (0)
Conjugate word blending: formal model and experimental implementation by XPCR (2021) (0)
An investigation into inter- and intragenomic variations of graphic genomic signatures (2015) (0)
Involutive Fibonacci Words (2021) (0)
State Complexity of Pseudocatenation (2019) (0)
SomaticSiMu: A mutational signature simulator (2021) (0)

This paper list is powered by the following services:

Other Resources About Lila Kari

en.wikipedia.org

What Schools Are Affiliated With Lila Kari?

Lila Kari is affiliated with the following schools:

Image Attributions

Image Source for Lila Kari