| Codes1 H Jürgensen, S Konstantinidis Handbook of Formal Languages: Volume 1 Word, Language, Grammar, 511-607, 2013 | 154* | 2013 |
| Coding properties of DNA languages S Hussini, L Kari, S Konstantinidis Theoretical Computer Science 290 (3), 1557-1579, 2003 | 98 | 2003 |
| Computing the edit distance of a regular language S Konstantinidis Information and Computation 205 (9), 1307-1316, 2007 | 73 | 2007 |
| Sticky-free and overhang-free DNA languages L Kari, S Konstantinidis, E Losseva, G Wozniak Acta Informatica 40 (2), 119-157, 2003 | 57 | 2003 |
| On properties of bond-free DNA languages L Kari, S Konstantinidis, P Sosík Theoretical Computer Science 334 (1-3), 131-159, 2005 | 43* | 2005 |
| Bond-free languages: formalizations, maximality and construction methods L Kari, S Konstantinidis, P Sosík International Journal of Foundations of Computer Science 16 (05), 1039-1070, 2005 | 41 | 2005 |
| An investigation into inter-and intragenomic variations of graphic genomic signatures R Karamichalis, L Kari, S Konstantinidis, S Kopecki BMC bioinformatics 16, 1-22, 2015 | 40 | 2015 |
| Hairpin structures in DNA words L Kari, S Konstantinidis, E Losseva, P Sosík, G Thierrin DNA Computing: 11th International Workshop on DNA Computing, DNA11, London …, 2006 | 40 | 2006 |
| Transducers and the properties of error detection, error correction and finite-delay decodability S Konstantinidis Journal of Universal Computer Science 8 (2), 278-291, 2002 | 39 | 2002 |
| Computing the Levenshtein distance of a regular language S Konstantinidis IEEE Information Theory Workshop, 2005., 4 pp., 2005 | 36 | 2005 |
| On hairpin-free words and languages L Kari, S Konstantinidis, P Sosík, G Thierrin Developments in Language Theory: 9th International Conference, DLT 2005 …, 2005 | 36 | 2005 |
| Additive methods for genomic signatures R Karamichalis, L Kari, S Konstantinidis, S Kopecki, S Solis-Reyes BMC bioinformatics 17, 1-18, 2016 | 32 | 2016 |
| Descriptional complexity of error/edit systems L Kari, S Konstantinidis Journal of Automata, Languages and Combinatorics 9 (2-3), 293-309, 2004 | 28 | 2004 |
| Maximal solid codes H Jürgensen, M Katsura, S Konstantinidis Journal of Automata, Languages and Combinatorics 6 (1), 25-50, 2001 | 25 | 2001 |
| A formal language analysis of DNA hairpin structures L Kari, E Losseva, S Konstantinidis, P Sosík, G Thierrin Fundamenta Informaticae 71 (4), 453-475, 2006 | 22 | 2006 |
| Formal descriptions of code properties: decidability, complexity, implementation K Dudzinski, S Konstantinidis International Journal of Foundations of Computer Science 23 (01), 67-85, 2012 | 21 | 2012 |
| Language equations, maximality and error-detection L Kari, S Konstantinidis Journal of Computer and System Sciences 70 (1), 157-178, 2005 | 21 | 2005 |
| Error correction for channels with substitutions, insertions, and deletions H Jürgensen, S Konstantinidis Canadian Workshop on Information Theory, 149-163, 1995 | 21 | 1995 |
| An algebra of discrete channels that involve combinations of three basic error types S Konstantinidis Information and Computation 167 (2), 120-131, 2001 | 18 | 2001 |
| Preventing undesirable bonds between DNA codewords L Kari, S Konstantinidis, P Sosík DNA Computing: 10th International Workshop on DNA Computing, DNA10, Milan …, 2005 | 16 | 2005 |
Lila Kari (nee Santean)Professor of Computer Science, University of Waterloo, CanadaAdresse e-mail validée de uwaterloo.ca
