| Year |
Citation |
Score |
| 2019 |
Enaganti SK, Kari L, Ng T, Wang Z. Word Blending in Formal Languages Fundamenta Informaticae. 171: 151-173. DOI: 10.3233/Fi-2020-1877 |
0.397 |
|
| 2018 |
Kari L, Konstantinidis S, Kopecki S, Yang M. Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers Algorithms. 11: 165. DOI: 10.3390/A11110165 |
0.357 |
|
| 2017 |
Enaganti SK, Ibarra OH, Kari L, Kopecki S. Further remarks on DNA overlap assembly Information & Computation. 253: 143-154. DOI: 10.1016/J.Ic.2017.01.009 |
0.456 |
|
| 2016 |
Karamichalis R, Kari L, Konstantinidis S, Kopecki S, Solis-Reyes S. Additive methods for genomic signatures. Bmc Bioinformatics. 17: 313. PMID 27549194 DOI: 10.1186/S12859-016-1157-8 |
0.325 |
|
| 2016 |
Enaganti SK, Ibarra OH, Kari L, Kopecki S. On the overlap assembly of strings and languages Natural Computing. 1-11. DOI: 10.1007/S11047-015-9538-X |
0.469 |
|
| 2016 |
Kari L, Kopecki S, Meunier PÉ, Patitz MJ, Seki S. Binary Pattern Tile Set Synthesis Is NP-Hard Algorithmica. 1-46. DOI: 10.1007/S00453-016-0154-7 |
0.327 |
|
| 2016 |
Kari L, Kulkarni MS. Disjunctivity and other properties of sets of pseudo-bordered words Acta Informatica. 1-20. DOI: 10.1007/S00236-016-0258-1 |
0.341 |
|
| 2015 |
Kari L, Hill KA, Sayem AS, Karamichalis R, Bryans N, Davis K, Dattani NS. Mapping the space of genomic signatures. Plos One. 10: e0119815. PMID 26000734 DOI: 10.1371/Journal.Pone.0119815 |
0.313 |
|
| 2015 |
Enaganti SK, Kari L, Kopecki S. A formal language model of DNA polymerase enzymatic activity Fundamenta Informaticae. 138: 179-192. DOI: 10.3233/Fi-2015-1206 |
0.463 |
|
| 2015 |
Jürgensen H, Kari L, Kopecki S. Methods for relativizing properties of codes Acta Cybernetica. 22: 259-292. DOI: 10.14232/Actacyb.22.2.2015.3 |
0.423 |
|
| 2015 |
Kari L, Konstantinidis S, Kopecki S. Transducer descriptions of DNA code properties and undecidability of antimorphic problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9118: 141-152. DOI: 10.1016/J.Ic.2017.09.004 |
0.427 |
|
| 2014 |
Kari L, Kopecki S, Simjour A. Hypergraph Automata: A theoretical model for patterned self-assembly International Journal of Foundations of Computer Science. 25: 419-439. DOI: 10.1142/S0129054114400048 |
0.386 |
|
| 2014 |
Kari L, Konstantinidis S, Kopecki S. On the maximality of languages with combined types of code properties Theoretical Computer Science. 550: 79-89. DOI: 10.1016/J.Tcs.2014.07.015 |
0.39 |
|
| 2013 |
Gao Y, Kari L. State complexity of star of union and square of union on k regular languages in memory of Dr. Sheng Yu Theoretical Computer Science. 499: 38-50. DOI: 10.1016/J.Tcs.2013.06.003 |
0.363 |
|
| 2013 |
Doty D, Kari L, Masson B. Negative Interactions in Irreversible Self-assembly Algorithmica. 66: 153-172. DOI: 10.1007/S00453-012-9631-9 |
0.303 |
|
| 2012 |
Chiniforooshan E, Daley M, Ibarra OH, Kari L, Seki S. One-reversal counter machines and multihead automata: Revisited Theoretical Computer Science. 454: 81-87. DOI: 10.1016/J.Tcs.2012.04.002 |
0.36 |
|
| 2012 |
Gao Y, Kari L, Yu S. State complexity of union and intersection of square and reversal on k regular languages Theoretical Computer Science. 454: 164-171. DOI: 10.1016/J.Tcs.2012.03.046 |
0.361 |
|
| 2012 |
Cui B, Gao Y, Kari L, Yu S. State complexity of combined operations with two basic operations Theoretical Computer Science. 437: 82-102. DOI: 10.1016/J.Tcs.2012.02.030 |
0.307 |
|
| 2012 |
Gao Y, Kari L, Yu S. State complexity of union and intersection of star on k regular languages Theoretical Computer Science. 429: 98-107. DOI: 10.1016/J.Tcs.2011.12.028 |
0.366 |
|
| 2012 |
Daley M, Jürgensen H, Kari L, Mahalingam K. Relativized codes Theoretical Computer Science. 429: 54-64. DOI: 10.1016/J.Tcs.2011.12.024 |
0.341 |
|
| 2012 |
Kari L, Kopecki S. Deciding whether a regular language is generated by a splicing system Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7433: 98-109. DOI: 10.1016/J.Jcss.2016.10.001 |
0.438 |
|
| 2012 |
Kari L, Kopecki S, Seki S. Iterated hairpin completions of non-crossing words Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7147: 337-348. DOI: 10.1007/978-3-642-27660-6_28 |
0.32 |
|
| 2011 |
Kari L, Seki S, Kopecki S. On the regularity of iterated hairpin completion of a single word Fundamenta Informaticae. 110: 201-215. DOI: 10.3233/Fi-2011-538 |
0.389 |
|
| 2011 |
Kari L, Seki S. Schema for parallel insertion and deletion: Revisited International Journal of Foundations of Computer Science. 22: 1655-1668. DOI: 10.1142/S0129054111008945 |
0.401 |
|
| 2011 |
Kari L, Masson B, Seki S. Properties of pseudo-primitive words and their applications International Journal of Foundations of Computer Science. 22: 447-471. DOI: 10.1142/S0129054111008131 |
0.338 |
|
| 2011 |
Daley M, Kari L, Seki S, Sosìk P. Orthogonal Shuffle On Trajectories International Journal of Foundations of Computer Science. 22: 213-222. DOI: 10.1142/S0129054111007964 |
0.398 |
|
| 2011 |
Kari L, Masson B. Polyominoes simulating arbitrary-neighborhood zippers and tilings Theoretical Computer Science. 412: 6083-6100. DOI: 10.1016/J.Tcs.2011.05.012 |
0.323 |
|
| 2011 |
Cui B, Kari L, Seki S. Block insertion and deletion on trajectories Theoretical Computer Science. 412: 714-728. DOI: 10.1016/J.Tcs.2010.11.009 |
0.38 |
|
| 2010 |
Czeizler E, Kari L, Seki S. On a special class of primitive words Theoretical Computer Science. 411: 617-630. DOI: 10.1016/J.Tcs.2009.09.037 |
0.398 |
|
| 2010 |
Kari L, Mahalingam K. Watson-Crick palindromes in DNA computing Natural Computing. 9: 297-316. DOI: 10.1007/S11047-009-9131-2 |
0.405 |
|
| 2009 |
Czeizler E, Kari L. Geometrical tile design for complex neighborhoods. Frontiers in Computational Neuroscience. 3: 20. PMID 19956398 DOI: 10.3389/Neuro.10.020.2009 |
0.309 |
|
| 2009 |
Adleman L, Kari J, Kari L, Reishus D, Sosik P. The undecidability of the infinite ribbon problem: Implications for computing by self-assembly Siam Journal On Computing. 38: 2356-2381. DOI: 10.1137/080723971 |
0.337 |
|
| 2009 |
Czeizler E, Kari L, Salomaa K. On the descriptional complexity of Watson-Crick automata Theoretical Computer Science. 410: 3250-3260. DOI: 10.1016/J.Tcs.2009.05.001 |
0.4 |
|
| 2009 |
Kari L, Seki S. On pseudoknot-bordered words and their properties Journal of Computer and System Sciences. 75: 113-121. DOI: 10.1016/J.Jcss.2008.08.002 |
0.418 |
|
| 2009 |
Czeizler E, Kari L, Seki S. An extension of the Lyndon Schützenberger result to pseudoperiodic words Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5583: 183-194. DOI: 10.1016/J.Ic.2011.01.001 |
0.354 |
|
| 2008 |
Kari L, Mahalingam K. Watson-Crick bordered words and their syntactic monoid International Journal of Foundations of Computer Science. 19: 1163-1179. DOI: 10.1142/S0129054108006200 |
0.43 |
|
| 2008 |
Kari L, Sosík P. On the weight of universal insertion grammars Theoretical Computer Science. 396: 264-270. DOI: 10.1016/J.Tcs.2008.01.037 |
0.41 |
|
| 2008 |
Ito M, Kari L, Kincaid Z, Seki S. Duplication in DNA sequences Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5257: 419-430. DOI: 10.1007/978-3-540-85780-8_33 |
0.359 |
|
| 2008 |
Kari L, Mahalingam K. Watson-Crick conjugate and commutative words Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4848: 273-283. DOI: 10.1007/978-3-540-77962-9_29 |
0.331 |
|
| 2007 |
Kari L, Mahalingam K. Involutively bordered words International Journal of Foundations of Computer Science. 18: 1089-1106. DOI: 10.1142/S0129054107005145 |
0.428 |
|
| 2007 |
Kari L, Mahalingam K. k-involution codes and related sets Journal of Discrete Mathematical Sciences and Cryptography. 10: 485-503. DOI: 10.1080/09720529.2007.10698134 |
0.336 |
|
| 2007 |
Kari L, Mahalingam K, Thierrin G. The syntactic monoid of hairpin-free languages Acta Informatica. 44: 153-166. DOI: 10.1007/S00236-007-0041-4 |
0.429 |
|
| 2005 |
Kari L, Konstantinidis S, Sosík P. Bond-free languages: Formalizations, maximality and construction methods International Journal of Foundations of Computer Science. 16: 1039-1070. DOI: 10.1142/S0129054105003467 |
0.447 |
|
| 2005 |
Kari L, Konstantinidis S, Sosík P. Operations on trajectories with applications to coding and bioinformatics International Journal of Foundations of Computer Science. 16: 531-546. DOI: 10.1142/S0129054105003145 |
0.364 |
|
| 2005 |
Kari L, Konstantinidis S, Sosík P. On properties of bond-free DNA languages Theoretical Computer Science. 334: 131-159. DOI: 10.1016/J.Tcs.2004.12.032 |
0.449 |
|
| 2005 |
Kari L, Sosík P. Aspects of shuffle and deletion on trajectories Theoretical Computer Science. 332: 47-61. DOI: 10.1016/J.Tcs.2004.09.038 |
0.428 |
|
| 2005 |
Kari L, Konstantinidis S. Language equations, maximality and error-detection Journal of Computer and System Sciences. 70: 157-178. DOI: 10.1016/J.Jcss.2004.08.005 |
0.412 |
|
| 2005 |
Kari L, Sosík P. On weight of universal insertion grammars 7th International Workshop On Descriptional Complexity of Formal Systems, Dcfs 2005 - Proceedings. 206-214. |
0.326 |
|
| 2005 |
Kari L, Konstantinidis S, Sosík P. Preventing undesirable bonds between DNA codewords Lecture Notes in Computer Science. 3384: 182-191. |
0.342 |
|
| 2005 |
Kari L, Konstantinidis S, Sosík P, Thierrin G. On hairpin-free words and languages Lecture Notes in Computer Science. 3572: 296-307. |
0.327 |
|
| 2004 |
Daley M, Kari L, McQuillan I. Families of languages defined by ciliate bio-operations Theoretical Computer Science. 320: 51-69. DOI: 10.1016/J.Tcs.2004.03.043 |
0.397 |
|
| 2004 |
Kari L, Konstantinidis S, Sosík P. Substitution on trajectories Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3113: 145-158. DOI: 10.1007/978-3-540-27812-2_14 |
0.403 |
|
| 2003 |
Daley M, Ibarra OH, Kari L. Closure and decidability properties of some language classes with respect to ciliate bio-operations Theoretical Computer Science. 306: 19-38. DOI: 10.1016/S0304-3975(03)00139-7 |
0.437 |
|
| 2003 |
Kari L, Konstantinidis S, Losseva E, Wozniak G. Sticky-free and overhang-free DNA languages Acta Informatica. 40: 119-157. DOI: 10.1007/S00236-003-0118-7 |
0.441 |
|
| 2003 |
Daley M, Kari L. Some properties of ciliate Bio-operations◊ Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2450: 116-127. |
0.326 |
|
| 2003 |
Kari L, Konstantinidis S. Static and Dynamic Properties of DNA Languages Annual International Conference of the Ieee Engineering in Medicine and Biology - Proceedings. 4: 3846-3849. |
0.366 |
|
| 2002 |
Hussini S, Kari L, Konstantinidis S. Coding properties of DNA languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2340: 57-69. DOI: 10.1016/S0304-3975(02)00069-5 |
0.466 |
|
| 2002 |
Kari L, Kitto R, Thierrin G. Codes, involutions, and DNA encodings Lecture Notes in Computer Science. 376-393. DOI: 10.1007/3-540-45711-9_21 |
0.354 |
|
| 2001 |
Kari L. DNA computing in vitro and in vivo Future Generation Computer Systems. 17: 823-834. DOI: 10.1016/S0167-739X(00)00061-3 |
0.43 |
|
| 2000 |
Kari L, Landweber LF. Computing with DNA. Methods in Molecular Biology (Clifton, N.J.). 132: 413-30. PMID 10547850 DOI: 10.1385/1-59259-192-2:413 |
0.309 |
|
| 2000 |
Ito M, Kari L, Thierrin G. Shuffle and scattered deletion closure of languages Theoretical Computer Science. 245: 115-133. DOI: 10.1016/S0304-3975(99)00277-7 |
0.405 |
|
| 2000 |
Kari L, Gloor G, Yu S. Using DNA to solve the Bounded Post Correspondence Problem Theoretical Computer Science. 231: 193-203. DOI: 10.1016/S0304-3975(99)00100-0 |
0.343 |
|
| 1999 |
Landweber LF, Kari L. The evolution of cellular computing: nature's solution to a computational problem. Bio Systems. 52: 3-13. PMID 10636025 DOI: 10.1016/S0303-2647(99)00027-1 |
0.331 |
|
| 1999 |
Freund R, Kari L, Pǎun G. DNA computing based on splicing: The existence of universal computers Theory of Computing Systems. 32: 69-112. DOI: 10.1007/S002240000112 |
0.308 |
|
| 1998 |
Kari L, Păun G, Rozenberg G, Salomaa A, Yu S. DNA computing, sticker systems, and universality ? Acta Informatica. 35: 401-420. DOI: 10.1007/S002360050125 |
0.375 |
|
| 1998 |
Kari L, Thierrin G. Word insertions and primitivity Utilitas Mathematica. 53: 49-61. |
0.306 |
|
| 1997 |
Ito M, Kari L, Thierrin G. Insertion and deletion closure of languages Theoretical Computer Science. 183: 3-19. DOI: 10.1016/S0304-3975(96)00307-6 |
0.413 |
|
| 1996 |
Hromkovič J, Kari J, Kari L, Pardubská D. Two lower bounds on distributive generation of languages Fundamenta Informaticae. 25: 271-284. DOI: 10.3233/Fi-1996-253405 |
0.361 |
|
| 1996 |
Kari L, Thierrin G. Contextual Insertions/Deletions and Computability Information and Computation. 131: 47-61. DOI: 10.1006/Inco.1996.0091 |
0.384 |
|
| 1996 |
Kari L, Pǎun G, Salomaa A. The power of restricted splicing with rules from a regular language Journal of Universal Computer Science. 2: 224-240. |
0.308 |
|
| 1995 |
Kari L, Mateescu A, Păun G, Salomaa A. Teams in cooperating grammar systems Journal of Experimental and Theoretical Artificial Intelligence. 7: 347-359. DOI: 10.1080/09528139508953816 |
0.338 |
|
| 1995 |
Kari L, Thierrin G. K-catenation and applications: k-prefix codes Journal of Information and Optimization Sciences. 16: 263-276. DOI: 10.1080/02522667.1995.10699222 |
0.388 |
|
| 1995 |
Kari L, Mateescu A, Pǎun G, Salomaa A. Multi-pattern languages Theoretical Computer Science. 141: 253-268. DOI: 10.1016/0304-3975(94)00087-Y |
0.396 |
|
| 1994 |
Kari L. Deletion operations: closure properties International Journal of Computer Mathematics. 52: 23-42. DOI: 10.1080/00207169408804288 |
0.411 |
|
| 1994 |
Kari L. On language equations with invertible operations Theoretical Computer Science. 132: 129-150. DOI: 10.1016/0304-3975(94)90230-5 |
0.36 |
|
| 1994 |
Hromkovič J, Kari J, Kari L. Some hierarchies for the communication complexity measures of cooperating grammar systems Theoretical Computer Science. 127: 123-147. DOI: 10.1016/0304-3975(94)90103-1 |
0.317 |
|
| Show low-probability matches. |