yusuke1997/dblp-id-title huggingface dataset:
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
Ranked Document Retrieval with Forbidden Pattern
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
Tighter Bounds for the Sum of Irreducible LCP Values
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
Computing Display Conflicts in String and Circular String Visualization
Conversion from RLBWT to LZ77
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, Prague, Czech Republic, June 27-29, 2022
A Data Structure for the Maximum-Sum Segment Problem with Offsets
On the Impact of Morphisms on BWT-Runs
The Median Problem for the Reversal Distance in Circular Bacterial Genomes
32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, Wrocław, Poland, July 5-7, 2021
Weighted Directed Word Graph
Obtaining Provably Good Performance from Suffix Trees in Secondary Storage
Searching 2D-Strings for Matching Frames
Fast RNA Structure Alignment for Crossing Input Structures
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
String Problems in the Congested Clique Model
Finding Optimal Alignment and Consensus of Circular Strings
DZ: A Text Compression Algorithm For Natural Languages
Faster Algorithm for the Set Variant of the String Barcoding Problem
Working on the Problem of Sorting by Transpositions on Genome Rearrangements
Faster Two Dimensional Pattern Matching with Rotations
A Context Dependent Method for Comparing Sequences
Cross-Document Pattern Matching
Shift Error Detection in Standardized Exams
Reconstruction of Trees from Jumbled and Weighted Subtrees
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
LCS Approximation via Embedding into Local Non-repetitive Strings
Permutation Pattern Matching for Doubly Partially Ordered Patterns
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File
Sorting by Cuts, Joins and Whole Chromosome Duplications
Verifying a Parameterized Border Array in O ( n 1.5 ) Time
Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC
Bounds on the Minimum Mosaic of Population Sequences under Recombination
Palindromic Length in Linear Time
Approximation of RNA Multiple Structural Alignment
An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum
Some Variations on Lyndon Words (Invited Talk)
Cartesian Tree Matching and Indexing
A Faster and Unifying Algorithm for Comparing Trees
FEMTO: Fast Search of Large Sequence Collections
Parametric Analysis for Ungapped Markov Models of Evolution
Computational Design of New and Recombinant Selenoproteins
An Improved Algorithm for the Macro-evolutionary Phylogeny Problem
Shortest Superstring
Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs
Linear Time Suffix Array Construction Using D-Critical Substrings
Encoding Hard String Problems with Answer Set Programming
Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back
Maximal Common Subsequences and Minimal Common Supersequences
A Family of Partial Cubes with Minimal Fibonacci Dimension
An O(n 3/2 sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations
Linear-time algorithms for the subpath kernel
Approximate Periods of Strings
GESTALT: Genomic Steiner Alignments
Linear-Time Algorithm for Long LCF with k Mismatches
k-Approximate Quasiperiodicity under Hamming and Edit Distance
An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression
Reducing the Space Requirement of LZ-Index
Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's
Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost
Compressed Weighted de Bruijn Graphs
Local Similarity Based Point-Pattern Matching
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries
A Unifying Look at d-Dimensional Periodicities and Space Coverings
String Powers in Trees
An Approximate Oracle for Distance in Metric Spaces
Optimal LZ-End Parsing Is Hard
Linear-Time Computation of Shortest Covers of All Rotations of a String
Edit Distance with Duplications and Contractions Revisited
On Demand String Sorting over Unbounded Alphabets
Parameterized Complexity of Superstring Problems
Compact Suffix Array
Two Dimensional Pattern Matching in a Digitized Image
On Undetected Redundancy in the Burrows-Wheeler Transform
Processing Compressed Texts: A Tractability Border
Finding Largest Well-Predicted Subset of Protein Structure Models
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing
Structural Properties and Tractability Results for Linear Synteny
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
The Nearest Colored Node in a Tree
On-Line Linear-Time Construction of Word Suffix Trees
Quasi-Periodicity in Streams
Fast String Dictionary Lookup with One Error
Mass Spectra Alignments and Their Significance
Minimal Separators of Two Words
Minimal Suffix and Rotation of a Substring in Optimal Time
Ranking Bracelets in Polynomial Time
Online Approximate Matching with Non-local Distances
Improved Approximation Algorithms for Tree Alignment
On the Structure of Syntenic Distance
Shortest Cover After Edit
Time-Space Tradeoffs for Finding a Long Common Substring
Aligning Coding DNA in the Presence of Frame-Shift Errors
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
On the Complexity of Deriving Position Specific Score Matrices from Examples
Maximal Common Connected Sets of Interval Graphs
Matrix Longest Common Subsequence Problem, Duality and Hibert Bases
Simplified Tight Bounds for Monotone Minimal Perfect Hashing
Longest Common Extensions in Sublinear Space
Spliced Alignment: A New Approach to Gene Recognition
Fast and Practical Approximate String Matching
Identifying Occurrences of Maximal Pairs in Multiple Strings
Compressed Indexing for Consecutive Occurrences
Pattern Matching in Directed Graphs
Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments
Approximate String Matching Using a Bidirectional Index
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms
Episode Matching
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
Internal Pattern Matching in Small Space and Applications
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions
A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Slowing Down Top Trees for Better Worst-Case Compression
Sufficient Conditions for Efficient Indexing Under Different Matchings
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
Longest Common Subsequence on Weighted Sequences
Speeding up Parsing of Biological Context-Free Grammars
A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes
Lower Bounds for Succinct Data Structures
A Linear Size Index for Approximate Pattern Matching
Approximate Matching of Run-Length Compressed Strings
Counting Distinct Patterns in Internal Dictionary Matching
Dictionary Matching with Uneven Gaps
Parallel and Distributed Compressed Indexes
The Longest Run Subsequence Problem: Further Complexity Results
Rectangular Tile Covers of 2D-Strings
Efficient Tree-Structured Categorical Retrieval
Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms
Document Listing for Queries with Excluded Pattern
Indexing Text with Approximate q-Grams
Tight Comparison Bounds for the String Prefix-Matching Problem
Composite Repetition-Aware Data Structures
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree
On Palindromic Periodicities
Self-normalised Distance with Don't Cares
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms
Color Set Size Problem with Application to String Matching
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations
Computing Similarity between RNA Structures
Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings
Genomic Scaffold Filling Revisited
Most Burrows-Wheeler Based Compressors Are Not Optimal
Compression, Indexing, and Retrieval for Massive String Data
Sublinear Algorithms for Parameterized Matching
Efficient Special Cases of Pattern Matching with Swaps
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts
Indexing the Bijective BWT
A Fast Set Intersection Algorithm for Sorted Sequences
Quick Greedy Computation for Minimum Common String Partitions
Fast Compatibility Testing for Rooted Phylogenetic Trees
Local Exact Pattern Matching for Non-fixed RNA Structures
Indexable Elastic Founder Graphs of Minimum Height
Fast Searching in Packed Strings
Forest Alignment with Affine Gaps and Anchors
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts
Multi-Dimensional Pattern Matching with Dimensional Wildcards
Self-indexing Based on LZ77
Succinct Representations of Separable Graphs
Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
Communication and Streaming Complexity of Approximate Pattern Matching
The Combinatorial Partitioning Method
New Algorithms for Position Heaps
On Indeterminate Strings Matching
Average-Case Analysis of Perfect Sorting by Reversals
Minimizing the Minimizers via Alphabet Reordering
Statistical Encoding of Succinct Data Structures
String Sanitization Under Edit Distance
Reporting Exact and Approximate Regular Expression Matches
Compactness-Preserving Mapping on Trees
Algorithms for Forest Pattern Matching
Order-Preserving Pattern Matching Indeterminate Strings
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Computing All Distinct Squares in Linear Time for Integer Alphabets
Incremental Inference of Relational Motifs with a Degenerate Alphabet
Reversal Distance without Hurdles and Fortresses
Nearest constrained circular words
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
Implicit Hitting Set Problems and Multi-genome Alignment
Perfect Hashing for Strings: Formalization and Algorithms
Original Synteny
Gene Regulation, Protein Networks and Disease: A Computational Perspective
Sparse Normalized Local Alignment
Real-Time String Matching in Sublinear Space
Multiple Matching of Parameterized Patterns
Alignment of Trees - An Alternative to Tree Edit
FM-Index Reveals the Reverse Suffix Array
Double String Tandem Repeats
Computational Regulatory Genomics
A New Algorithm for the Ordered Tree Inclusion Problem
On the Compressiveness of the Burrows-Wheeler Transform
New Bounds for Motif Finding in Strong Instances
The Parameterized Complexity of Sequence Alignment and Consensus
A Compact Index for Cartesian Tree Matching
Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets
Breakpoint Distance and PQ-Trees
Position Heaps for Parameterized Strings
An Output-Sensitive Flexible Pattern Discovery Algorithm
Minimal Absent Words on Run-Length Encoded Strings
String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music
36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, Milan, Italy, June 17-19, 2025
Constructing Strings Avoiding Forbidden Substrings
Disorders and Permutations
Succinct Non-overlapping Indexing
On Distances Between Words with Parameters
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis
On Extensions of Maximal Repeats in Compressed Strings
When Is the Normalized Edit Distance over Non-Uniform Weights a Metric?
Making de Bruijn Graphs Eulerian
Wheeler Graphs: Variations on a Theme by Burrows and Wheeler
Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings
Hamming Distance Completeness
Longest Common Extensions with Recompression
Dynamic String Alignment
A Filter Method for the Weighted Local Similarity Search Problem
Combinatorial Pattern Matching, 7th Annual Symposium, CPM 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings
Fast Approximate Matching using Suffix Trees
A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
Computing Exact p-Value for Structured Motif
Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles
The Worst Case Complexity of Maximum Parsimony
Encodings for Range Majority Queries
Flexible Identification of Structural Objects in Nucleic Acid Sequences: Palindromes, Mirror Repeats, Pseudoknots and Triple Helices
Approximate Point Set Pattern Matching on Sequences and Planes
Average-Case Analysis of Approximate Trie Search (Extended Abstract)
On Two Measures of Distance Between Fully-Labelled Trees
Dictionary Matching with One Gap
Practical Software for Aligning ESTs to Human Genome
Deterministic Indexing for Packed Strings
A really Simple Approximation of Smallest Grammar
Lyndon Factorization of Grammar Compressed Texts Revisited
34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, Marne-la-Vallée, France, June 26-28, 2023
Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practice (Extended Abstract)
Unique Perfect Phylogeny Is NP -Hard
Space Lower Bounds for Online Pattern Matching
String Sanitization Under Edit Distance: Improved and Generalized
Searching for Gapped Palindromes
Approximate String Matching and Local Similarity
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Space-Economical Algorithms for Finding Maximal Unique Matches
On Minimal and Maximal Suffixes of a Substring
PalFM-Index: FM-Index for Palindrome Pattern Matching
Hairpin Completion Distance Lower Bound
Suffix Trees on Words
Longest Common Separable Pattern Among Permutations
Graph Motif Problems Parameterized by Dual
String Matching in Hypertext
One-Gapped q-Gram Filtersfor Levenshtein Distance
Repetitions in Strings: A "Constant" Problem (Invited Talk)
Compressed Index for a Dynamic Collection of Texts
Time-Space Trade-Offs for the Longest Common Substring Problem
Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time
Gapped Pattern Statistics
Large Scale Matching for Position Weight Matrices
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time
A Computational Model for RNA Multiple Structural Alignment.
A Succinct Grammar Compression
Forty Years of Text Indexing
Linear-time Suffix Sorting - A New Approach for Suffix Array Construction
Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs
Balanced Suffix Trees (Invited Lecture)
On-Line Approximate String Matching with Bounded Errors
Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings
Approximate All-Pairs Suffix/Prefix Overlaps
Phylogeny- and Parsimony-Based Haplotype Inference with Constraints
Approximation Algorithms for Multiple Sequence Alignment
Graph Mining: Patterns, Generators and Tools
Non-Overlapping Indexing - Cache Obliviously
Multiple Alignment with Guaranteed Error Bounds and Communication Cost
Polynomial-Time Approximation Algorithms for Weighted LCS Problem
Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths
Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
The Dynamic k-Mismatch Problem
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
Exact and Approximation Algorithms for DNA Tag Set Design
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
Constant-Time Word-Size String Matching
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space
Approximating Longest Common Substring with k mismatches: Theory and Practice
An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees
Two-Dimensional Pattern Matching with Rotations
Sampled Longest Common Prefix Array
Most Recent Match Queries in On-Line Suffix Trees
Hardness of RNA Folding Problem With Four Symbols
Faster Bit-Parallel Approximate String Matching
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
A Simple Fast Hybrid Pattern-Matching Algorithm
Detecting False Matches in String Matching Algorithms
Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings
Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract)
On Approximating String Selection Problems with Outliers
Shortest Unique Substring Query Revisited
Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance
Parameterized Complexity Analysis for the Closest String with Wildcards Problem
The Property Suffix Tree with Dynamic Properties
A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications
Boyer-Moore Strategy to Efficient Approximate String Matching
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms
A Fast Algorithm for Approximate String Matching on Gene Sequences
A Class of Heuristics for Reducing the Number of BWT-Runs in the String Ordering Problem
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
On the Complexity of Sparse Exon Assembly
Space- and Time-Efficient Decoding with Canonical Huffman Trees
New Results and Open Problems Related to Non-Standard Stringology
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
The Parameterized Complexity of the Shared Center Problem
Efficient Algorithm for Circular Burrows-Wheeler Transform
Explaining and Controlling Ambiguity in Dynamic Programming
Simple and Practical Sequence Nearest Neighbors with Block Operations
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees
Constructing Suffix Arrays for Multi-dimensional Matrices
Quasi-Periodicity Under Mismatch Errors
Statistical Properties of Factor Oracles
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract)
Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern
Computing the Equation Automaton of a Regular Expression in Space and Time
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond
Compressed Multiple Pattern Matching
Tandem Cyclic Alignment
Longest substring palindrome after edit
Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant
Aligning Alignments
Compressed Dictionary Matching on Run-Length Encoded Strings
AWLCO: All-Window Length Co-Occurrence
Performing Local Similarity Searches with Variable Length Seeds
Tiling an Interval of the Discrete Line
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm
Computing Inverse ST in Linear Complexity
Covers in Optimal Space
Filtration with q-Samples in Approximate String Matching
Representing the Suffix Tree with the CDAWG
Generalized Substring Compression
Bi-Directional r-Indexes
Alignment between Two Multiple Alignments
On the Weak Prefix-Search Problem
Proximity Matching Using Fixed-Queries Trees
Searching Long Repeats in Streams
Faster Algorithms for delta, gamma-Matching and Related Problems
Approximating Text-To-Pattern Distance via Dimensionality Reduction
Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots
Regular Expression Constrained Sequence Alignment
The Trie Measure, Revisited
A Linear Kernel for the Complementary Maximal Strip Recovery Problem
Wavelet Trees for All
Encodings of Range Maximum-Sum Segment Queries and Applications
Approximating Approximate Pattern Matching
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk)
Small-Space 2D Compressed Dictionary Matching
Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching
Finding a Small Number of Colourful Components
Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
Efficient Construction of Long Orientable Sequences
Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract)
On Incremental Computation of Transitive Closure and Greedy Alignment
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree
An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery
Heaviest Increasing/Common Subsequence Problems
A Space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
Approximate String-Matching over Suffix Trees
Phylogenetic Footprinting and Consistent Sets of Local Aligments
Finding All Common Intervals of k Permutations
The Maximum Weight Trace Problem in Multiple Sequence Alignment
Greedy Conjecture for Strings of Length 4
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction
Pattern Matching with Variables: A Multivariate Complexity Analysis
A New and Faster Method of Sorting by Transpositions
Trie-Compressed Adaptive Set Intersection
Fast Algorithms for Computing Tree LCS
Finding Diverse Strings and Longest Common Subsequences in a Graph
Minimum Quartet Inconsistency Is Fixed Parameter Tractable
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping
Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It
Periodic String Comparison
Permuted Scaled Matching
Compact Indexes for Flexible Top- k k Retrieval
Restricted Common Superstring and Restricted Common Supersequence
Algorithms for Computing the Longest Parameterized Common Subsequence
Reducing the Size of NFAs by Using Equivalences and Preorders
Faster Binary Mean Computation Under Dynamic Time Warping
31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, Copenhagen, Denmark, June 17-19, 2020
Entropy Lower Bounds for Dictionary Compression
Lempel Ziv Computation in Small Space (LZ-CISS)
Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation
Parameterized Algorithms for Matrix Completion with Radius Constraints
Identifying Co-referential Names Across Large Corpora
Alphabet-Dependent String Searching with Wexponential Search Trees
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions
Internal Shortest Absent Word Queries
Fast Error-Tolerant Quartet Phylogeny Algorithms
27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, June 27-29, 2016
Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment
Two Dimensional Parameterized Matching
Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract)
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP
Identifying Periodic Occurrences of a Template with Applications to Protein Structures