Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: A Real Linear and Parallel Multiple Longest Common Subsequences (MLCS) Algorithm
a fast algorithm for computing longest subsequences .
On the relationship between P-log and LP MLN
Linear pattern matching algorithms
Backtrack search algorithms and the maximal common subgraph problem
A Dynamic Programming Approach to Sequencing Problems
Finding the most unusual time series subsequence: algorithms and applications
A fast string-searching algorithm for multiple patterns
A Composite Boyer-Moore Algorithm for the String Matching Problem
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
A Note on the Consecutive Ones Submatrix Problem
encoplot : pairwise sequence matching in linear time applied to plagiarism detection ∗ .
MSLiP: a computer code for the multistage stochastic linear programming problem
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction
A parallel Smith-Waterman algorithm based on divide and conquer
Searching and Mining Trillions of Time Series Subsequences under Dynamic Time Warping
Introducing efficient parallelism into approximate string matching and a new serial algorithm
Variation of Boyer-Moore String Matching Algorithm : A Comparative Analysis
Optimal Parallel Algorithms for Computing the Sum, the Prefix-Sums, and the Summed Area Table on the Memory Machine Models
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Algorithms on strings, trees, and sequences
Studying Impacts of Prefix Interception Attack by Exploring BGP AS-PATH Prepending
Credit Card Fraud Detection Using Hidden Markov Model
The String-to-String Correction Problem
27.12MHz GaN Bi-directional resonant power converter
Information-theoretic metric learning