Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time. - Hwee Kim; Yo-Sub Han (FAW, 2014)

Online Multiple Palindrome Pattern Matching. - Hwee Kim; Yo-Sub Han (SPIRE, 2014)

Pseudo-inversion on Formal Languages. - Da-Jung Cho; Yo-Sub Han; Shin-Dong Kang; Hwee Kim; Sang-Ki Ko; Kai Salomaa (UCNC, 2014)

Alignment with Non-overlapping Inversions on Two Strings. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (WALCOM, 2014)

Frequent Pattern Mining with Non-overlapping Inversions. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (LATA, 2015)

Alignment with non-overlapping inversions and translocations on two strings. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (Theor. Comput. Sci., 2015)

Non-overlapping inversion on strings and languages. - Hwee Kim; Yo-Sub Han (Theor. Comput. Sci., 2015)

OMPPM: online multiple palindrome pattern matching. - Hwee Kim; Yo-Sub Han (Bioinform., 2016)

Duplications and Pseudo-Duplications. - Da-Jung Cho; Yo-Sub Han; Hwee Kim; Alexandros Palioudakis; Kai Salomaa (Int. J. Unconv. Comput., 2016)

Pseudo-inversion: closure properties and decidability. - Da-Jung Cho; Yo-Sub Han; Shin-Dong Kang; Hwee Kim; Sang-Ki Ko; Kai Salomaa (Nat. Comput., 2016)

Deduplication on Finite Automata and Nested Duplication Systems. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (UCNC, 2017)

Site-Directed Deletion. - Da-Jung Cho; Yo-Sub Han; Hwee Kim; Kai Salomaa (DLT, 2018)

Construction of Geometric Structure by Oritatami System. - Yo-Sub Han; Hwee Kim (DNA, 2018)

Nondeterministic seedless oritatami systems and hardness of testing their equivalence. - Yo-Sub Han; Hwee Kim; Makoto Ota; Shinnosuke Seki 001 (Nat. Comput., 2018)

Algebraic Systems Motivated by DNA Origami. - James Garrett; Natasa Jonoska; Hwee Kim; Masahico Saito (CAI, 2019)

DNA Origami Words and Rewriting Systems. - James Garrett; Natasa Jonoska; Hwee Kim; Masahico Saito (UCNC, 2019)

Cyclic Oritatami Systems Cannot Fold Infinite Fractal Curves. - Yo-Sub Han; Hwee Kim (CoRR, 2019)

Self-Attraction Removal from Oritatami Systems. - Yo-Sub Han; Hwee Kim; Trent A. Rogers; Shinnosuke Seki 001 (Int. J. Found. Comput. Sci., 2019)

Bound-decreasing duplication system. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (Theor. Comput. Sci., 2019)

Ruleset optimization on isomorphic oritatami systems. - Yo-Sub Han; Hwee Kim (Theor. Comput. Sci., 2019)

Symbol Separation in Double Occurrence Words. - Natasa Jonoska; Masahico Saito; Hwee Kim; Brad Mostowski (Int. J. Found. Comput. Sci., 2020)

Transcript design problem of oritatami systems. - Yo-Sub Han; Hwee Kim; Shinnosuke Seki 001 (Nat. Comput., 2020)

Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami. - Szilárd Zsolt Fazekas; Hwee Kim; Ryuichi Matsuoka; Reoto Morita; Shinnosuke Seki 001 (Int. J. Found. Comput. Sci., 2021)

DNA origami words, graphical structures and their rewriting systems. - James Garrett; Natasa Jonoska; Hwee Kim; Masahico Saito (Nat. Comput., 2021)

Impossibility of strict assembly of infinite fractals by oritatami. - Yo-Sub Han; Hwee Kim (Nat. Comput., 2021)

A general architecture of oritatami systems for simulating arbitrary finite automata. - Yo-Sub Han; Hwee Kim; Yusei Masuda; Shinnosuke Seki 001 (Theor. Comput. Sci., 2021)

On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding. - Szilárd Zsolt Fazekas; Hwee Kim; Ryuichi Matsuoka; Shinnosuke Seki 001; Hinano Takeuchi (ISAAC, 2022)