Da-Jung Cho's Page

 
전통적인 도서관

Introduction

I am a computer science theoretician and am working in the Department of Software and Computer Engineering at Ajou University since March 2021.

Research Interests:

  • Formal Language and Automata Theory

  • Algorithm Design

  • Synthetic Biology

  • Circuit Complexity

Contact:​

  • 산학협력원 509호, Dept. of Software and Computer Engineering, Ajou University, 206 Worldcup-ro, Yeongtong-gu, Suwon, 16499, Korea (Republic of)

  • +82 (031) 219 2635

  • +82 10 4708 9334

  • dajungcho [at] ajou [dot] ac [dot] kr

  

 
Picture1.png
 

Publications


[DBLP: Da-Jung Cho], [Google Scholar], [ORCID]


[CONFERENCES]

  1. Distributed Computation with Continual Population Growth, Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, Quentin Soubeyran, International Symposium on Distributed Computing (DISC'20), LIPIcs 179, [pdf] [video]

  2. Site-Directed Deletion, Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa, Developments in Language Theory (DLT’18), LNCS 11088, 219-230, 2018 [pdf][slide]

  3. Site-Directed Insertion: Decision Problems, Maximality and Minimality, Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor Smith, Descriptional Complexity of Formal Systems (DCFS'18), LNCS 10952, 49-61, 2018 [pdf]

  4. Deduplication on Finite Automata and Nested Duplication Systems, Da-Jung Cho, Yo-Sub Han, Hwee Kim, Unconventional Computation & Natural Computation (UCNC’17), LNCS10240, 194-205, 2017 [pdf][slide]

  5. Outfix-Guided Insertion, Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa, Developments in Language Theory (DLT’16), LNCS 9840, 102-113, 2016 [pdf]

  6. Pseudoknot-Generating Operation, Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa, Current Trends in Theory and Practice of Computer Science (SOFSEM'16), LNCS 9587, 241-252, 2016 [pdf]

  7. Frequent Pattern Mining with Non-overlapping Inversions, Da-Jung Cho, Yo-Sub Han, Hwee Kim, Language and Automata Theory and Applications (LATA’15), LNCS 8977, 121-132, 2015 [pdf]

  8. State Complexity of Permutations on Finite Languages over Binary Alphabets, Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa, Descriptional Complexity of Formal Systems (DCFS'15), LNCS 9118, 220-230, 2015 [pdf]

  9. Duplications and Pseudo-Duplications, Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa, Unconventional Computation & Natural Computation (UCNC'15), LNCS 9252, 157-168, 2015 [pdf]

  10. State Complexity of Inversion Operations, Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa, Descriptional Complexity of Formal Systems (DCFS'14), LNCS 8614, 102-113, 2014 [pdf]

  11. Pseudo-Inversion on Formal Languages, Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa, Unconventional Computation & Natural Computation (UCNC'14), LNCS 8553, 93-104, 2014, “Best Paper Score Award” [pdf][slide]

  12. Alignment with Non-Overlapping Inversions on Two Strings, Da-Jung Cho, Yo-Sub Han, Hwee Kim, Algorithms and Computation (WALCOM’14), LNCS 8344, 261-272, 2014 [pdf]

[JOURNAL]

  1. Site-Directed Insertion: Language equations and decision problems, Da-Jung Cho, Yo-Sub Han, Kai Salomaa and Taylor Smith, Theoretical Computer Science (TCS), Vol. 798, 40-51, December 2019 [pdf]

  2. Bound-Decreasing Duplication System, Da-Jung Cho, Yo-Sub Han, Hwee Kim, Theoretical Computer Science (TCS), Vol. 793, 152-168, November 2019 [pdf]

  3. Outfix-Guided Insertion, Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa, Theoretical Computer Science (TCS),Vol. 701, 70-84, November 2017 [pdf]

  4. Pseudoknot-Generating Operation, Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa, Theoretical Computer Science (TCS), Vol. 696, 52-64, October 2017 [pdf]

  5. State Complexity of Permutation on Finite Languages over a Binary Alphabet, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis, Kai Salomaa, Theoretical Computer Science (TCS), Vol. 682, 67-78, June 2017 [pdf]

  6. Duplications and Pseudo-Duplications, Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa, International Journal of Unconventional Computing (IJUC), Vol. 12(2-3), 145-167, May 2016 [pdf]

  7. Pseudo-Inversion: Closure Properties and Decidability, Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa, Natural Computing, Vol. 15, 31-39, March 2016 [pdf

  8. State Complexity of Inversion Operations, Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa, Theoretical Computer Science (TCS), Vol. 610, 2-12, January 2016 [pdf]

  9. Alignment with Non-Overlapping Inversions and Translocations on Two Strings, Da-Jung Cho, Yo-Sub Han, Hwee Kim, Theoretical Computer Science (TCS), Vol. 575, 90-101, April 2015 [pdf]

  10. Decidability of Involution Hypercodes, Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Theoretical Computer Science (TCS), Vol. 550, 90-99, September 2014 [pdf]

[PATENTS]

  1. Apparatus and Method for Determining if Site-Directed Deletion is Possible, Yo-Sub Han, Da-Jung Cho, Hwee Kim, 10-2017-0075890, 2017  

  2. Method for Creating Automata for Determination of Nested-Duplication, Yo-Sub Han, Da-Jung Cho, Hwee Kim, 10-2017-0066232, 2017

  3. Method and Device for Mining Pattern on Inversion of Biological Sequence, Yo-Sub Han, Hwee Kim, Da-Jung Cho, 10-1636202, 2016

  4. Device and Method for Determining Pseudoknot Structure of Biological Sequence, Yo-Sub Han, Da-Jung Cho, Hwee Kim, 10-2016-0007615, 2016

 

EXPERIENCE

[Education]

  • 09 / 2011 - 02 / 2018: Ph.D., Formal Languages and Automata Theory, Computer Science, Yonsei University, Seoul, South Korea, Thesis: Bio-inspired Operations on Formal Languages and Its Properties [slide]

  • 03 / 2007 – 08 / 2011: Bachelor, Computer Engineering,  Korea Polytechnic University, Siheung, South Korea

[Working Experience]

  • Since 03 / 2021 : Assistant Professor, Ajou University

  • 09 / 2019 - 02 / 2021: Post Doc researcher, University of Kassel

    • Working in the fields of Theoretical Computer Science and Complex Systems

    • Characterizing visibly pushdown languages that can be described by First-order logic with arbitrary predicate  

  • 05 / 2018 – 08 / 2019: Post Doc researcher, Université Paris-Sud and ENS Paris-Saclay

    • Working in the fields of Synthetic Biology

    • Design distributed communication models for microbiological circuits

  • 03 / 2018 – 04 / 2018: Post Doc researcher, Yonsei University 

    • Working in the fields of Formal Language and Automata Theory

    • Designing an efficient algorithm for decision problem over the bio-inspired operation and biological phenomenon predicting problem

 

ACTIVITY

[ACTIVITY]

  1. 2021: Program committee of DCFS 2021

  2. 04 / 2020 - :Lecturer, University of Kassel, Regular Pattern Matching

  3. Reviewer for International conferences UCNC, DLT, CIAA and Journal Natural Computing

  4. 01 / 2019: Program committee of UCNC 2019

  5. 01 / 2018: Visiting researcher of Prof. Kari at University of Waterloo

  6. 10 / 2017 – 02 / 2018: Visiting researcher at Queen’s University

  7. Local Organizing Committee of the 21st International Conference on Implementation and Application of Automata (CIAA) 2016

  8. 06 / 2016 – 07 / 2016: Visiting researcher at Queen’s University

  9. 09 / 2015 – 12 / 2015: Lecturer, Yonsei University, Introduction to Engineering Design

[AWARDS]

  1. 10 / 2017 – 02 / 2018: Globalink Research Award from Mitacs and NRF

  2. Spring 2016 semester: NAVER Ph.D Fellowship from NAVER

  3. Spring 2016 semester: The Graduate Fellowship from Dept. Computer Science, Yonsei University

  4. Fall 2016 semester: The Graduate Fellowship from Dept. Computer Science, Yonsei University 

  5. 07 / 2014: Awarded Best Paper for the paper “Pseudo-Inversion on Formal Languages” in UCNC’14