Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper
Query: Succinct suffix arrays based on run-length encoding
optimal exact strring matching based on suffix arrays .
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction
The Burrows-Wheeler Transform: Theory and Practice
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
Computation of Similarity Measures for Sequential Data using Generalized Suffix Trees
a fast algorithm for computing longest subsequences .
A survey of longest common subsequence algorithms
Second step algorithms in the Burrows-Wheeler compression algorithm
A one-time signature using run-length encoding
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Parallelized Rabin-Karp method for exact string matching
optimization of boyer - moore - horspool - sunday algorithm .
Hardware-Acceleration of Short-Read Alignment Based on the Burrows-Wheeler Transform
Introducing efficient parallelism into approximate string matching and a new serial algorithm
A fast string searching algorithm
Variation of Boyer-Moore String Matching Algorithm : A Comparative Analysis
A Composite Boyer-Moore Algorithm for the String Matching Problem
A Compact RDF Store Using Suffix Arrays
Row-wise tiling for the Myers' bit-parallel approximate string matching algorithm
A linear space algorithm for computing maximal common subsequences
Learning Spread-Out Local Feature Descriptors
Linear pattern matching algorithms
Evaluation of the ARTutor augmented reality educational platform in tertiary education
Aspect-Oriented Analysis and Design: The Theme Approach
Habit and intention in everyday life: The multiple processes by which past behavior predicts future behavior.