Heejin Park

Available identifiers

Publication	Date of Publication	Type
FM-index of alignment with gaps	2018-02-16	Paper
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm	2017-02-06	Paper
FM-index of alignment: a compressed index for similar strings	2016-06-16	Paper
Suffix Tree of Alignment: An Efficient Index for Similar Data	2014-01-17	Paper
Finding consensus and optimal alignment of circular strings	2013-02-19	Paper
Efficient algorithms for consensus string problems minimizing both distance sum and radius	2011-10-10	Paper
Finding Optimal Alignment and Consensus of Circular Strings	2010-07-26	Paper
Linear-Time Construction of Suffix Arrays	2010-04-06	Paper
Boolean circuit programming: A new paradigm to design parallel algorithms	2009-06-24	Paper
Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays	2009-03-24	Paper
Protocol completion incentive problems in cryptographic Vickrey auctions	2008-07-31	Paper
Using multiple indexes for efficient subsequence matching in time-series databases	2008-01-03	Paper
String Processing and Information Retrieval	2006-10-24	Paper
Combinatorial Pattern Matching	2005-12-14	Paper
Constructing suffix arrays in linear time	2005-10-27	Paper
Information Security Practice and Experience	2005-09-13	Paper
Deleting keys of B-trees in parallel	2004-11-18	Paper
Parallel algorithms for red--black trees	2002-03-03	Paper

This page was built for person: Heejin Park