Joong Chae Na

474 total citations
24 papers, 144 citations indexed

About

Joong Chae Na is a scholar working on Artificial Intelligence, Hardware and Architecture and Molecular Biology. According to data from OpenAlex, Joong Chae Na has authored 24 papers receiving a total of 144 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 13 papers in Hardware and Architecture and 10 papers in Molecular Biology. Recurrent topics in Joong Chae Na's work include Algorithms and Data Compression (17 papers), Network Packet Processing and Optimization (12 papers) and DNA and Biological Computing (6 papers). Joong Chae Na is often cited by papers focused on Algorithms and Data Compression (17 papers), Network Packet Processing and Optimization (12 papers) and DNA and Biological Computing (6 papers). Joong Chae Na collaborates with scholars based in South Korea, Italy and United States. Joong Chae Na's co-authors include Kunsoo Park, Jeong Seop Sim, Kyung-Joong Kim, Alberto Apostolico, Costas S. Iliopoulos, Heejin Park, Junho Seo, Raffaele Giancarlo, Je‐Keun Rhee and Soo-Yong Shin and has published in prestigious journals such as Bioinformatics, Neurocomputing and Computers in Biology and Medicine.

In The Last Decade

Joong Chae Na

21 papers receiving 142 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Joong Chae Na South Korea 7 98 59 39 16 15 24 144
Jeong Seop Sim South Korea 7 129 1.3× 72 1.2× 51 1.3× 41 2.6× 9 0.6× 28 190
Heikki Hyyrö Finland 8 112 1.1× 75 1.3× 58 1.5× 13 0.8× 22 1.5× 21 159
Jesmin Jahan Tithi United States 8 87 0.9× 18 0.3× 47 1.2× 12 0.8× 12 0.8× 22 176
Yongheng Xing China 8 62 0.6× 39 0.7× 5 0.1× 5 0.3× 29 1.9× 23 171
Laura Nenzi Italy 7 47 0.5× 16 0.3× 11 0.3× 49 3.1× 7 0.5× 25 142
Simon Gog Germany 9 171 1.7× 115 1.9× 63 1.6× 12 0.8× 10 0.7× 29 201
Yoan J. Pinzón Colombia 7 119 1.2× 36 0.6× 54 1.4× 20 1.3× 20 1.3× 20 150
Gheorghe Ştefănescu Romania 9 100 1.0× 35 0.6× 30 0.8× 82 5.1× 9 0.6× 30 214
Noa Lewenstein Israel 7 132 1.3× 83 1.4× 37 0.9× 72 4.5× 9 0.6× 14 152
Ravi Pandya United States 6 30 0.3× 32 0.5× 17 0.4× 7 0.4× 65 4.3× 13 188

Countries citing papers authored by Joong Chae Na

Since Specialization
Citations

This map shows the geographic impact of Joong Chae Na's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Joong Chae Na with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joong Chae Na more than expected).

Fields of papers citing papers by Joong Chae Na

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joong Chae Na. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Joong Chae Na. The network helps show where Joong Chae Na may publish in the future.

Co-authorship network of co-authors of Joong Chae Na

This figure shows the co-authorship network connecting the top 25 collaborators of Joong Chae Na. A scholar is included among the top collaborators of Joong Chae Na based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Joong Chae Na. Joong Chae Na is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Na, Joong Chae, et al.. (2024). Order-Preserving Pattern Matching with Partition. Mathematics. 12(21). 3381–3381.
2.
Na, Joong Chae, et al.. (2023). DB+-tree: A new variant of B+-tree for main-memory database systems. Information Systems. 119. 102287–102287. 3 indexed citations
3.
Na, Joong Chae, et al.. (2022). Order-preserving pattern matching with scaling. Information Processing Letters. 180. 106333–106333. 3 indexed citations
4.
Na, Joong Chae, et al.. (2019). Fast single individual haplotyping method using GPGPU. Computers in Biology and Medicine. 113. 103421–103421. 3 indexed citations
5.
Na, Joong Chae, et al.. (2019). A Simple Heuristic for Order-Preserving Matching. IEICE Transactions on Information and Systems. E102.D(3). 502–504. 4 indexed citations
6.
Na, Joong Chae, et al.. (2016). A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm. Theoretical Computer Science. 656. 173–179. 4 indexed citations
7.
Na, Joong Chae, Hyunjoon Kim, Heejin Park, et al.. (2015). FM-index of alignment: A compressed index for similar strings. Theoretical Computer Science. 638. 159–170. 9 indexed citations
8.
Na, Joong Chae, et al.. (2014). A fast algorithm for order-preserving pattern matching. Information Processing Letters. 115(2). 397–402. 22 indexed citations
9.
Kim, Young Ho, et al.. (2013). Approximate Periods of Strings based on Distance Sum for DNA Sequence Analysis. KIPS Transactions on Software and Data Engineering. 2(2). 119–122.
10.
Na, Joong Chae, et al.. (2012). Finding consensus and optimal alignment of circular strings. Theoretical Computer Science. 468. 92–101. 2 indexed citations
11.
Amir, Amihood, Gad M. Landau, Joong Chae Na, et al.. (2011). Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theoretical Computer Science. 412(39). 5239–5246. 6 indexed citations
12.
Choi, Hongjun, et al.. (2011). Exploration of CPU/GPU co-execution. 38–43. 2 indexed citations
13.
Na, Joong Chae, et al.. (2010). On-line construction of parameterized suffix trees for large alphabets. Information Processing Letters. 111(5). 201–207. 12 indexed citations
14.
Na, Joong Chae, et al.. (2009). Linear-Time Construction of Two-Dimensional Suffix Trees. Algorithmica. 59(2). 269–297. 4 indexed citations
15.
Na, Joong Chae, et al.. (2009). Alignment of biological sequences with quality scores. International Journal of Bioinformatics Research and Applications. 5(1). 97–97. 3 indexed citations
16.
Na, Joong Chae, et al.. (2009). Fast Computation of Rank and Select Functions for Succinct Representation. IEICE Transactions on Information and Systems. E92-D(10). 2025–2033. 2 indexed citations
17.
Na, Joong Chae, et al.. (2009). Finding the longest common nonsuperstring in linear time. Information Processing Letters. 109(18). 1066–1070.
18.
Na, Joong Chae, et al.. (2008). Efficient OTP(One Time Password) Generation using AES-based MAC. Journal of Korea Multimedia Society. 11(6). 845–851. 4 indexed citations
19.
Na, Joong Chae, Raffaele Giancarlo, & Kunsoo Park. (2007). On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time. Algorithmica. 48(2). 173–186. 5 indexed citations
20.
Na, Joong Chae, Alberto Apostolico, Costas S. Iliopoulos, & Kunsoo Park. (2003). Truncated suffix trees and their application to data compression. Theoretical Computer Science. 304(1-3). 87–101. 24 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026