• 694 Citations
  • 13 h-Index
20052019
If you made any changes in Pure these will be visible here soon.

Research Output 2005 2019

2019

A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata

Han, Y-S., Kim, H., Masuda, Y. & Seki, S., 2019 Jan 1, Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. Hospodár, M. & Jirásková, G. (eds.). Springer Verlag, p. 146-157 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11601 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Finite Automata
Finite automata
Turing machines
Turing Machine
Turing

Alignment distance of regular tree languages

Han, Y-S. & Ko, S. K., 2019 Oct 1, In : Theoretical Computer Science. 787, p. 127-137 11 p.

Research output: Contribution to journalArticle

Alignment
Maximum Degree
Bioinformatics
XML
Tree Automata

Bound-decreasing duplication system

Cho, D. J., Han, Y-S. & Kim, H., 2019 Jan 1, In : Theoretical Computer Science.

Research output: Contribution to journalArticle

Finite automata
Duplication
Finite State Automata
Strings
Formal languages

Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity

Han, Y-S., Ko, S. K. & Salomaa, K., 2019 Jan 1, Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. Konstantinidis, S., Hospodár, M. & Jirásková, G. (eds.). Springer Verlag, p. 158-170 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11612 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computability and decidability
Pushdown Automata
Treewidth
Nondeterminism
Finite automata

Ruleset optimization on isomorphic oritatami systems

Han, Y-S. & Kim, H., 2019 Jan 1, In : Theoretical Computer Science.

Research output: Contribution to journalArticle

Folding
Hardness
Fold
Isomorphic
RNA

Site-directed insertion: Language equations and decision problems

Cho, D. J., Han, Y-S., Salomaa, K. & Smith, T. J., 2019 Jan 1, In : Theoretical Computer Science.

Research output: Contribution to journalArticle

Decision problem
Insertion
Semantics
Trajectories
Overlapping
2018
1 Citation (Scopus)

An abusive text detection system based on enhanced abusive and non-abusive word lists

Lee, H. S., Lee, H. R., Park, J. U. & Han, Y-S., 2018 Sep 1, In : Decision Support Systems. 113, p. 22-31 10 p.

Research output: Contribution to journalArticle

Unsupervised learning
Language
Learning
Social Networking
Social Work

An Efficient Video Series Decision Algorithm Based on Actor-Face Recognition

Lee, H. R., Kim, H., Han, Y-S., Seo, Y. & Im, D. H., 2018 Sep 25, 2018 International Conference on Platform Technology and Service, PlatCon 2018. Institute of Electrical and Electronics Engineers Inc., 8472744

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Face recognition
Internet

Closest Substring Problems for Regular Languages

Han, Y. S., Ko, S. K., Ng, T. & Salomaa, K., 2018 Jan 1, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer Verlag, p. 392-403 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Formal languages
Regular Languages
Finite automata
Strings
Finite Automata
3 Citations (Scopus)

Construction of geometric structure by oritatami system

Han, Y-S. & Kim, H., 2018 Jan 1, DNA Computing and Molecular Programming - 24th International Conference, DNA 24, 2018, Proceedings. Doty, D. & Dietz, H. (eds.). Springer Verlag, p. 173-188 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11145 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Self-assembly
Geometric Structure
Self assembly
Hinges
Nanostructures

Growth rate of minimum branching

Palioudakis, A., Han, Y-S. & Salomaa, K., 2018 Jan 1, In : Journal of Automata, Languages and Combinatorics. 23, 1-3, p. 281-292 12 p.

Research output: Contribution to journalArticle

Finite automata
Branching
Nondeterminism
Finite Automata
7 Citations (Scopus)

Nondeterministic seedless oritatami systems and hardness of testing their equivalence

Han, Y-S., Kim, H., Ota, M. & Seki, S., 2018 Mar 1, In : Natural Computing. 17, 1, p. 67-79 13 p.

Research output: Contribution to journalArticle

RNA
Conformations
Hardness
Testing
Turing machines

Online stochastic pattern matching

Cognetta, M. & Han, Y. S., 2018 Jan 1, Implementation and Application of Automata - 23rd International Conference, CIAA 2018, Proceedings. Springer Verlag, p. 121-132 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10977 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pattern matching
Pattern Matching
Streaming Data
Matching Problem
Strings

Site-Directed Deletion

Cho, D. J., Han, Y. S., Kim, H. & Salomaa, K., 2018 Jan 1, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer Verlag, p. 219-230 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computability and decidability
Mutagenesis
Deletion
DNA
Strings
1 Citation (Scopus)

Site-directed insertion: Decision problems, maximality and minimality

Cho, D. J., Han, Y-S., Salomaa, K. & Smith, T. J., 2018 Jan 1, Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. Konstantinidis, S. & Pighizzini, G. (eds.). Springer Verlag, p. 49-61 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10952 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Minimality
Decision problem
Insertion
Semantics
Trajectories
1 Citation (Scopus)

Transcript design problem of oritatami systems

Han, Y-S., Kim, H. & Seki, S., 2018 Jan 1, DNA Computing and Molecular Programming - 24th International Conference, DNA 24, 2018, Proceedings. Doty, D. & Dietz, H. (eds.). Springer Verlag, p. 139-154 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11145 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

RNA
Fold
Conformations
Genes
Models of Computation
2017

Alignment distance of regular tree languages

Han, Y. S. & Ko, S. K., 2017 Jan 1, Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings. Springer Verlag, Vol. 10329 LNCS. p. 126-137 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10329 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alignment
Maximum Degree
Bioinformatics
XML
Tree Automata
7 Citations (Scopus)

Ambiguity, nondeterminism and state complexity of finite automata

Han, Y-S., Salomaa, A. & Salomaa, K., 2017 Jan 1, In : Acta Cybernetica. 23, 1, p. 141-157 17 p.

Research output: Contribution to journalArticle

State Complexity
Nondeterminism
Finite Automata
Finite automata
Counting

Consensus string problem for multiple regular languages

Han, Y-S., Ko, S. K., Ng, T. & Salomaa, K., 2017 Jan 1, Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings. Drewes, F., Martín-Vide, C. & Truthe, B. (eds.). Springer Verlag, p. 196-207 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10168 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Formal languages
Regular Languages
Strings
Finite automata
Polynomials
47 Citations (Scopus)

Critical care admission following elective surgery was not associated with survival benefit: prospective analysis of data from 27 countries

Kahan, B. C., Koulenti, D., Arvaniti, K., Beavis, V., Campbell, D., Chan, M., Moreno, R., Pearse, R. M., Pearse, R. M., Beattie, S., Clavien, P-A., Demartines, N., Fleisher, L. A., Grocott, M., Haddow, J., Hoeft, A., Holt, P., Moreno, R., Pritchard, N., Rhodes, A. & 30 others, Wijeysundera, D., Wilson, M., Ahmed, T., Everingham, K., Hewson, R., Januszewska, M., Pearse, R. M., Phull, M-K., Lee, E., Choi, S., Chen, C., Han, Y., Yang, S., Han, K., Chen, C., Chu, S., Chung, C. K. E., Lee, C., Lee, Y. C., Lee, H. S., Lee, J. M., Choi, H-MD., Kim, C. J., Kim, S., Park, K., Chang, Y. H., Chang, J., Lee, C., Lee, G. & Kim, T., 2017, In : Intensive Care Medicine. 43, 7

Research output: Contribution to journalArticle

Critical Care
Survival
Mortality
Logistic Models
Perioperative Care
1 Citation (Scopus)

Deduplication on finite automata and nested duplication systems

Cho, D. J., Han, Y-S. & Kim, H., 2017 Jan 1, Unconventional Computation and Natural Computation - 16th International Conference, UCNC 2017, Proceedings. Patitz, M. J. & Stannett, M. (eds.). Springer Verlag, p. 194-205 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10240 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Finite Automata
Finite automata
Duplication
Finite State Automata
Strings
3 Citations (Scopus)

Edit-distance between visibly pushdown languages

Han, Y-S. & Ko, S. K., 2017 Jan 1, SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. & Steffen, B. (eds.). Springer Verlag, p. 387-401 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10139 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Context free languages
Edit Distance
Context-free Languages
Personal digital assistants
Polynomials
3 Citations (Scopus)

Outfix-guided insertion

Cho, D. J., Han, Y-S., Ng, T. & Salomaa, K., 2017 Nov 21, In : Theoretical Computer Science. 701, p. 70-84 15 p.

Research output: Contribution to journalArticle

Finite automata
Insertion
Context free languages
DNA
Polynomials

Preface

Han, Y-S. & Salomaa, K., 2017 Aug 1, In : International Journal of Foundations of Computer Science. 28, 5, p. 437-439 3 p.

Research output: Contribution to journalEditorial

Pseudoknot-generating operation

Cho, D. J., Han, Y. S., Ng, T. & Salomaa, K., 2017 Oct 5, In : Theoretical Computer Science. 696, p. 52-64 13 p.

Research output: Contribution to journalArticle

Formal languages
Regular Languages
Strings
Context free languages
Deterministic Finite Automata
6 Citations (Scopus)

Ruleset optimization on isomorphic oritatami systems

Han, Y-S. & Kim, H., 2017 Jan 1, DNA Computing and Molecular Programming - 23rd International Conference, DNA 23, Proceedings. Brijder, R. & Qian, L. (eds.). Springer Verlag, p. 33-45 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10467 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

RNA
Fold
Isomorphic
Optimization
Models of Computation
6 Citations (Scopus)

Self-attraction removal from oritatami systems

Han, Y-S., Kim, H., Rogers, T. A. & Seki, S., 2017 Jan 1, Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. Pighizzini, G. & Campeanu, C. (eds.). Springer Verlag, p. 164-176 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10316 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

RNA
Fold
Folding
Computational Model
Molecules

State complexity of k-parallel tree concatenation

Han, Y-S., Ko, S. K. & Salomaa, K., 2017 Jan 1, In : Fundamenta Informaticae. 154, 1-4, p. 185-199 15 p.

Research output: Contribution to journalArticle

State Complexity
Concatenation
Tree Automata
Upper bound
Lower bound
2 Citations (Scopus)

State complexity of permutation on finite languages over a binary alphabet

Cho, D. J., Goč, D., Han, Y-S., Ko, S. K., Palioudakis, A. & Salomaa, K., 2017 Jun 19, In : Theoretical Computer Science. 682, p. 67-78 12 p.

Research output: Contribution to journalArticle

State Complexity
Deterministic Finite Automata
Finite automata
Permutation
Strings
2 Citations (Scopus)

Template-based pattern matching in two-dimensional arrays

Han, Y-S. & Průša, D., 2017 Jan 1, Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings. Barneva, R. P., Brimkov, V. E. & Brimkov, V. E. (eds.). Springer Verlag, p. 79-92 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10256 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pattern matching
Pattern Matching
Template
Finite Automata
Finite automata
2016
6 Citations (Scopus)

Approximate matching between a context-free grammar and a finite-state automaton

Ko, S. K., Han, Y-S. & Salomaa, K., 2016 Apr 1, In : Information and Computation. 247, p. 278-289 12 p.

Research output: Contribution to journalArticle

Context free grammars
Finite State Automata
Edit Distance
Context-free Grammar
Finite automata
3 Citations (Scopus)

Duplications and pseudo-duplications

Cho, D. J., Han, Y. S., Kim, H., Palioudakis, A. & Salomaa, K., 2016 Jan 1, In : International Journal of Unconventional Computing. 12, 2-3, p. 145-167 23 p.

Research output: Contribution to journalArticle

Formal languages
Context sensitive languages
Context free languages
Copying
Finite automata
2 Citations (Scopus)

Inferring a relax NG schema from XML documents

Kim, G. H., Ko, S. K. & Han, Y-S., 2016 Jan 1, Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Proceedings. Truthe, B., Janoušek, J., Dediu, A-H. & Martín-Vide, C. (eds.). Springer Verlag, p. 400-411 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9618).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

XML Schema
XML
Schema
Grammar
Structural Properties
4 Citations (Scopus)

Nondeterministic seedless oritatami systems and hardness of testing their equivalence

Han, Y. S., Kim, H., Ota, M. & Seki, S., 2016 Jan 1, DNA Computing and Molecular Programming - 22nd International Conference, DNA 2016, Proceedings. Springer Verlag, Vol. 9818 LNCS. p. 19-34 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9818 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nondeterminism
RNA
Hardness
Conformations
Equivalence

OMPPM: Online multiple palindrome pattern matching

Kim, H. & Han, Y-S., 2016 Apr 15, In : Bioinformatics. 32, 8, p. 1151-1157 7 p.

Research output: Contribution to journalArticle

Palindrome
Pattern matching
Pattern Matching
Matching Problem
RNA Sequence Analysis
1 Citation (Scopus)

Operational State Complexity of Subtree-Free Regular Tree Languages

Ko, S. K., Eom, H. S. & Han, Y-S., 2016 Sep 1, In : International Journal of Foundations of Computer Science. 27, 6, p. 705-724 20 p.

Research output: Contribution to journalArticle

XML
Stars

Outfix-guided insertion

Cho, D. J., Han, Y-S., Ng, T. & Salomaa, K., 2016 Jan 1, Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings. Reutenauer, C. & Brlek, S. (eds.). Springer Verlag, p. 102-113 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9840).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Context free languages
Finite automata
Insertion
DNA
Polynomials

Preface

Han, Y. S. & Salomaa, K., 2016 Jan 1, In : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9705, p. V-VI

Research output: Contribution to journalEditorial

Pseudo-inversion: closure properties and decidability

Cho, D. J., Han, Y-S., Kang, S. D., Kim, H., Ko, S. K. & Salomaa, K., 2016 Mar 1, In : Natural Computing. 15, 1, p. 31-39 9 p.

Research output: Contribution to journalArticle

Context free languages
Computability and decidability
Formal languages
DNA sequences
Polynomials
1 Citation (Scopus)

Pseudoknot-generating operation

Cho, D. J., Han, Y-S., Ng, T. & Salomaa, K., 2016 Jan 1, SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Freivalds, R. M., Engels, G. & Catania, B. (eds.). Springer Verlag, p. 241-252 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9587).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Formal languages
RNA
Regular Languages
Context free languages
Finite automata
7 Citations (Scopus)

State Complexity of Basic Operations on Non-Returning Regular Languages

Eom, H. S., Han, Y-S. & Jirásková, G., 2016 Mar 4, In : Fundamenta Informaticae. 144, 2, p. 161-182 22 p.

Research output: Contribution to journalArticle

State Complexity
Formal languages
Regular Languages
Boolean Operation
Suffix
5 Citations (Scopus)

State complexity of deletion and bipolar deletion

Han, Y-S., Ko, S. K. & Salomaa, K., 2016 Feb 1, In : Acta Informatica. 53, 1, p. 67-85 19 p.

Research output: Contribution to journalArticle

Formal languages
Finite automata
5 Citations (Scopus)

State complexity of insertion

Han, Y-S., Ko, S. K., Ng, T. & Salomaa, K., 2016 Nov 1, In : International Journal of Foundations of Computer Science. 27, 7, p. 863-878 16 p.

Research output: Contribution to journalArticle

Formal languages
Finite automata
2 Citations (Scopus)

State complexity of inversion operations

Cho, D. J., Han, Y. S., Ko, S. K. & Salomaa, K., 2016 Jan 11, In : Theoretical Computer Science. 610, p. 2-12 11 p.

Research output: Contribution to journalArticle

State Complexity
Inversion
Prefix
Strings
Reversal
1 Citation (Scopus)

State Complexity of Regular Tree Languages for Tree Matching

Ko, S. K., Lee, H. R. & Han, Y-S., 2016 Dec 1, In : International Journal of Foundations of Computer Science. 27, 8, p. 965-979 15 p.

Research output: Contribution to journalArticle

2015
9 Citations (Scopus)

Alignment with non-overlapping inversions and translocations on two strings

Cho, D. J., Han, Y-S. & Kim, H., 2015 Jan 1, In : Theoretical Computer Science. 575, 1, p. 90-101 12 p.

Research output: Contribution to journalArticle

Translocation
Inversion
Alignment
Strings
Sequence Alignment
7 Citations (Scopus)

A Recommendation Model Using the Bandwagon Effect for E-Marketing Purposes in IoT

Choi, S. M., Lee, H., Han, Y-S., Man, K. L. & Chong, W. K., 2015 Jan 1, In : International Journal of Distributed Sensor Networks. 2015, 475163.

Research output: Contribution to journalArticle

Marketing
Recommender systems
Internet of things
Communication

Duplications and pseudo-duplications

Cho, D. J., Han, Y-S., Kim, H., Palioudakis, A. & Salomaa, K., 2015 Jan 1, Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings. Calude, C. S. & Dinneen, M. J. (eds.). Springer Verlag, p. 157-168 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9252).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Context sensitive languages
Context free languages
Formal languages
Finite automata
Duplication
1 Citation (Scopus)

Frequent pattern mining with non-overlapping inversions

Cho, D. J., Han, Y. S. & Kim, H., 2015 Jan 1, Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Proceedings. Springer Verlag, Vol. 8977. p. 121-132 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8977).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Frequent Pattern Mining
Frequent Pattern
Bioinformatics
Inversion
Sequence Comparison
1 Citation (Scopus)

Generalizations of code languages with marginal errors

Han, Y. S., Ko, S. K. & Salomaa, K., 2015 Jan 1, Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Springer Verlag, Vol. 9168. p. 264-275 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9168).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Prefix-free
Suffix
Context free languages
Strings
Formal languages