Heejin Park

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
FM-index of alignment with gaps Theoretical Computer Science	2018-02-16	Paper
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm Theoretical Computer Science	2017-02-06	Paper
FM-index of alignment: a compressed index for similar strings Theoretical Computer Science	2016-06-16	Paper
Suffix tree of alignment: an efficient index for similar data Lecture Notes in Computer Science	2014-01-17	Paper
Finding consensus and optimal alignment of circular strings Theoretical Computer Science	2013-02-19	Paper
Efficient algorithms for consensus string problems minimizing both distance sum and radius Theoretical Computer Science	2011-10-10	Paper
Finding optimal alignment and consensus of circular strings Combinatorial Pattern Matching	2010-07-26	Paper
Linear-time construction of suffix arrays (extended abstract) Combinatorial Pattern Matching	2010-04-06	Paper
Boolean circuit programming: A new paradigm to design parallel algorithms Journal of Discrete Algorithms	2009-06-24	Paper
Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays Algorithmica	2009-03-24	Paper
Protocol completion incentive problems in cryptographic Vickrey auctions Electronic Commerce Research	2008-07-31	Paper
Using multiple indexes for efficient subsequence matching in time-series databases Information Sciences	2008-01-03	Paper
String Processing and Information Retrieval Lecture Notes in Computer Science	2006-10-24	Paper
Combinatorial Pattern Matching Lecture Notes in Computer Science	2005-12-14	Paper
Constructing suffix arrays in linear time Journal of Discrete Algorithms	2005-10-27	Paper
Information Security Practice and Experience Lecture Notes in Computer Science	2005-09-13	Paper
Deleting keys of B-trees in parallel Journal of Parallel and Distributed Computing	2004-11-18	Paper
Parallel algorithms for red--black trees Theoretical Computer Science	2002-03-03	Paper

Research outcomes over time

This page was built for person: Heejin Park