The following pages link to Kunsoo Park (Q1754030):
Displaying 50 items.
- (Q169686) (redirect page) (← links)
- The working set algorithm has competitive ratio less than two (Q287173) (← links)
- FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
- A fast algorithm for order-preserving pattern matching (Q477704) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- An efficient parallel algorithm for scheduling interval ordered tasks (Q652455) (← links)
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Fast multiple pattern Cartesian tree matching (Q782168) (← links)
- Implementing approximate regularities (Q815420) (← links)
- An efficient alignment algorithm for masked sequences (Q868939) (← links)
- The consensus string problem for a metric is NP-complete (Q876700) (← links)
- A dynamic edit distance table (Q876720) (← links)
- A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
- Computing similarity of run-length encoded strings with affine gap penalty (Q932322) (← links)
- Improving multikey Quicksort for sorting strings with many equal elements (Q987791) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Analysis of two-dimensional approximate pattern matching algorithms (Q1129016) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency (Q1328093) (← links)
- Dynamic dictionary matching (Q1337462) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← links)
- A fast algorithm for the all-pairs suffix-prefix problem (Q1676303) (← links)
- FM-index of alignment with gaps (Q1698723) (← links)
- Joint decisions on product line selection, purchasing, and pricing (Q1754031) (← links)
- Offshoring and outsourcing in a global supply chain: impact of the arm's length regulation on transfer pricing (Q1754061) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- Deleting keys of B-trees in parallel (Q1886373) (← links)
- Covering a string (Q1924404) (← links)
- Finding consensus and optimal alignment of circular strings (Q1935794) (← links)
- On-line construction of parameterized suffix trees for large alphabets (Q1944073) (← links)
- Impact of the arm's length regulation on a supply chain with asymmetric retailers (Q2116903) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- Transferring and sharing exchange-rate risk in a risk-averse supply chain of a multinational firm (Q2253995) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- Finding periods in Cartesian tree matching (Q2301735) (← links)
- On representations of ternary order relations in numeric strings (Q2363988) (← links)
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time (Q2384787) (← links)
- A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets (Q2390293) (← links)
- Fast batch modular exponentiation with common-multiplicand multiplication (Q2410573) (← links)
- Fair threshold decryption with semi-trusted third parties (Q2430144) (← links)
- Order-preserving matching (Q2437748) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Continuous-time Markov chain models to estimate the premium for extended hedge fund lockups (Q2449361) (← links)
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365) (← links)
- Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
