default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeong Seop Sim
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Youngho Kim
, Munseong Kang, Joong Chae Na, Jeong Seop Sim:
Order-preserving pattern matching with scaling. Inf. Process. Lett. 180: 106333 (2023)
2010 – 2019
- 2018
- [j16]Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim:
An O(n2logm)-time algorithm for the boxed-mesh permutation pattern matching problem. Theor. Comput. Sci. 710: 35-43 (2018) - 2017
- [j15]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. Math. Comput. Sci. 11(2): 127-136 (2017) - [c16]Sungchan Hur, Sukhyeun Cho, Youngho Kim, Jeong Seop Sim:
A power- and storage-efficient HLS media server for multi-bitrate VOD services. BigComp 2017: 193-198 - 2016
- [j14]Mun-Kyu Lee, Pierre Michaud, Jeong Seop Sim, DaeHun Nyang:
A simple proof of optimality for the MIN cache replacement policy. Inf. Process. Lett. 116(2): 168-170 (2016) - [j13]Youngho Kim, Joong Chae Na, Heejin Park, Jeong Seop Sim:
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm. Theor. Comput. Sci. 656: 173-179 (2016) - 2015
- [j12]Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
A fast algorithm for order-preserving pattern matching. Inf. Process. Lett. 115(2): 397-402 (2015) - [c15]Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim:
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem. CPM 2015: 138-148 - [c14]Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park:
Fast Multiple Order-Preserving Matching Algorithms. IWOCA 2015: 248-259 - [i1]Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park:
Fast Multiple Order-Preserving Matching Algorithms. CoRR abs/1506.05203 (2015) - 2014
- [j11]Minseok Song, Wanhyung Ryu, Jeong Seop Sim, Yeongju Lee:
Balancing disk energy against reliability in video playback. Multim. Syst. 20(1): 25-43 (2014) - [c13]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. ICABD 2014: 46-52 - 2013
- [j10]Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding consensus and optimal alignment of circular strings. Theor. Comput. Sci. 468: 92-101 (2013) - [c12]Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
Fast Order-Preserving Pattern Matching. COCOA 2013: 295-305 - 2011
- [j9]Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
Linear-Time Construction of Two-Dimensional Suffix Trees. Algorithmica 59(2): 269-297 (2011) - [j8]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011) - 2010
- [c11]Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding Optimal Alignment and Consensus of Circular Strings. CPM 2010: 310-322 - [c10]Minseok Song, Wanhyung Ryu, Jeong Seop Sim:
Reducing disk power consumption in portable media players. ESTIMedia 2010: 81-89
2000 – 2009
- 2009
- [j7]Joong Chae Na, Namhee Kim, Jeong Seop Sim, Dong Kyue Kim:
Improving on-line construction of two-dimensional suffix trees for square matrices. Inf. Process. Lett. 109(10): 504-508 (2009) - [j6]Joong Chae Na, Dong Kyue Kim, Jeong Seop Sim:
Finding the longest common nonsuperstring in linear time. Inf. Process. Lett. 109(18): 1066-1070 (2009) - [c9]Jin Wook Kim, Siwon Choi, Joong Chae Na, Jeong Seop Sim:
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model. ISAAC 2009: 1185-1194 - [c8]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242 - 2007
- [c7]Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. CPM 2007: 352-364 - 2006
- [c6]Jeong Seop Sim, Soo-Jun Park:
Transcription Factor Binding Sites Prediction Based on Sequence Similarity. FSKD 2006: 1058-1061 - 2005
- [j5]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. J. Autom. Lang. Comb. 10(5/6): 609-626 (2005) - [j4]Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Constructing suffix arrays in linear time. J. Discrete Algorithms 3(2-4): 126-142 (2005) - [j3]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Implementing approximate regularities. Math. Comput. Model. 42(7-8): 855-866 (2005) - [c5]Jeong Seop Sim:
Time and Space Efficient Search for Small Alphabets with Suffix Arrays. FSKD (1) 2005: 1102-1107 - [c4]Sung-Hee Park, Chan Yong Park, Dae-Hee Kim, Seon Hee Park, Jeong Seop Sim:
Protein Structure Abstractionand Automatic Clustering Using Secondary Structure Element Sequences. ICCSA (2) 2005: 1284-1292 - 2003
- [j2]Jeong Seop Sim, Kunsoo Park:
The consensus string problem for a metric is NP-complete. J. Discrete Algorithms 1(1): 111-117 (2003) - [c3]Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Linear-Time Construction of Suffix Arrays. CPM 2003: 186-199 - [c2]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. Stringology 2003: 25-36 - 2001
- [j1]Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate periods of strings. Theor. Comput. Sci. 262(1): 557-568 (2001)
1990 – 1999
- 1999
- [c1]Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate Periods of Strings. CPM 1999: 123-133
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 2025-03-11 20:03 CET 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:
