default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHwee Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c17]Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, Hinano Takeuchi:
On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding. ISAAC 2022: 37:1-37:15- 2021
- [j15]Szilárd Zsolt Fazekas
, Hwee Kim, Ryuichi Matsuoka, Reoto Morita, Shinnosuke Seki:
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami. Int. J. Found. Comput. Sci. 32(5): 575-596 (2021) - [j14]James Garrett, Natasa Jonoska, Hwee Kim, Masahico Saito:
DNA origami words, graphical structures and their rewriting systems. Nat. Comput. 20(2): 217-231 (2021) - [j13]Yo-Sub Han, Hwee Kim:
Impossibility of strict assembly of infinite fractals by oritatami. Nat. Comput. 20(4): 691-701 (2021) - [j12]Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki:
A general architecture of oritatami systems for simulating arbitrary finite automata. Theor. Comput. Sci. 870: 29-52 (2021) - 2020
- [j11]Natasa Jonoska, Masahico Saito, Hwee Kim, Brad Mostowski:
Symbol Separation in Double Occurrence Words. Int. J. Found. Comput. Sci. 31(7): 915-928 (2020) - [j10]Yo-Sub Han, Hwee Kim, Shinnosuke Seki:
Transcript design problem of oritatami systems. Nat. Comput. 19(2): 323-335 (2020)
2010 – 2019
- 2019
- [j9]Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki:
Self-Attraction Removal from Oritatami Systems. Int. J. Found. Comput. Sci. 30(6-7): 1047-1067 (2019) - [j8]Yo-Sub Han, Hwee Kim:
Ruleset optimization on isomorphic oritatami systems. Theor. Comput. Sci. 785: 128-139 (2019) - [j7]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Bound-decreasing duplication system. Theor. Comput. Sci. 793: 152-168 (2019) - [c16]James Garrett, Natasa Jonoska, Hwee Kim, Masahico Saito:
Algebraic Systems Motivated by DNA Origami. CAI 2019: 164-176 - [c15]James Garrett, Natasa Jonoska, Hwee Kim, Masahico Saito:
DNA Origami Words and Rewriting Systems. UCNC 2019: 94-107 - [c14]Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki:
A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata. CIAA 2019: 146-157 - [i2]Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki:
A general architecture of oritatami systems for simulating arbitrary finite automata. CoRR abs/1904.10174 (2019) - [i1]Yo-Sub Han, Hwee Kim:
Cyclic Oritatami Systems Cannot Fold Infinite Fractal Curves. CoRR abs/1908.04409 (2019) - 2018
- [j6]Yo-Sub Han, Hwee Kim, Makoto Ota, Shinnosuke Seki:
Nondeterministic seedless oritatami systems and hardness of testing their equivalence. Nat. Comput. 17(1): 67-79 (2018) - [c13]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa:
Site-Directed Deletion. DLT 2018: 219-230 - [c12]Yo-Sub Han, Hwee Kim, Shinnosuke Seki:
Transcript Design Problem of Oritatami Systems. DNA 2018: 139-154 - [c11]Yo-Sub Han, Hwee Kim:
Construction of Geometric Structure by Oritatami System. DNA 2018: 173-188 - 2017
- [c10]Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki:
Self-attraction Removal from Oritatami Systems. DCFS 2017: 164-176 - [c9]Yo-Sub Han, Hwee Kim:
Ruleset Optimization on Isomorphic Oritatami Systems. DNA 2017: 33-45 - [c8]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Deduplication on Finite Automata and Nested Duplication Systems. UCNC 2017: 194-205 - 2016
- [j5]Hwee Kim, Yo-Sub Han:
OMPPM: online multiple palindrome pattern matching. Bioinform. 32(8): 1151-1157 (2016) - [j4]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. Int. J. Unconv. Comput. 12(2-3): 145-167 (2016) - [j3]Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa:
Pseudo-inversion: closure properties and decidability. Nat. Comput. 15(1): 31-39 (2016) - [c7]Yo-Sub Han, Hwee Kim, Makoto Ota, Shinnosuke Seki:
Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence. DNA 2016: 19-34 - 2015
- [j2]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Alignment with non-overlapping inversions and translocations on two strings. Theor. Comput. Sci. 575: 90-101 (2015) - [j1]Hwee Kim, Yo-Sub Han:
Non-overlapping inversion on strings and languages. Theor. Comput. Sci. 592: 9-22 (2015) - [c6]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Frequent Pattern Mining with Non-overlapping Inversions. LATA 2015: 121-132 - [c5]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. UCNC 2015: 157-168 - 2014
- [c4]Hwee Kim, Yo-Sub Han:
Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time. FAW 2014: 141-150 - [c3]Hwee Kim, Yo-Sub Han:
Online Multiple Palindrome Pattern Matching. SPIRE 2014: 173-178 - [c2]Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa:
Pseudo-inversion on Formal Languages. UCNC 2014: 93-104 - [c1]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Alignment with Non-overlapping Inversions on Two Strings. WALCOM 2014: 261-272
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
