yusuke1997/dblp-id-title huggingface dataset:
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
Identifying and Filtering Near-Duplicate Documents
Dynamic Fully-Compressed Suffix Trees
Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018
Bidirectional Search in a String with Wavelet Trees
External Inverse Pattern Matching
On the Complexity of Positional Sequencing by Hybridization
Direct Construction of Compact Directed Acyclic Word Graphs
Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds
Faster STR-IC-LCS Computation via RLE
Randomized and Parameterized Algorithms for the Closest String Problem
Approximation Algorithms for Orienting Mixed Graphs
On Wavelet Tree Construction
Why Greed Works for Shortest Common Superstring Problem
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations
Connecting de Bruijn Graphs
On the Weighted Quartet Consensus Problem
Maximal Common Subsequence Algorithms
Text Indexing with Errors
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time
Faster Online Elastic Degenerate String Matching
Computing all Suboptimal Alignments in Linear Space
Finding Common RNA Secondary Structures from RNA Sequences
Compact q-Gram Profiling of Compressed Strings
Least Random Suffix/Prefix Matches in Output-Sensitive Time
Multiple Pattern Matching Algorithms on Collage System
Unit Route Upper Bound for String-Matching on Hypercube
Efficient Index for Weighted Sequences
Mechanical Proving with Walnut for Squares and Cubes in Partial Words
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform
Efficient Parallel Algorithm for the Editing Distance between Ordered Trees
Approximate String Matching Using Compressed Suffix Arrays
A Language Approach to String Searching Evaluation
Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements
Dynamic Entropy-Compressed Sequences and Full-Text Indexes
Bounds on the Number of String Subsequences
Dictionary Loop-Up with Small Errors
Dynamic Elias-Fano Representation
Pattern-Matching for Strings with Short Descriptions
Indexed Geometric Jumbled Pattern Matching
Walking on Words
An(other) Entropy-Bounded Compressed Suffix Tree
Sparse LCS Common Substring Alignment
Fixed-Parameter Algorithms for Finding Agreement Supertrees
Document Listing on Repetitive Collections with Guaranteed Performance
Cover Array String Reconstruction
Encodings for Range Minimum Queries over Bounded Alphabets
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings
Covering a String
Tractability Results for the Consecutive-Ones Property with Multiplicity
The Longest Common Subsequence Problem for Arc-Annotated Sequences
Computing longest common square subsequences
Solving the Minimal Positional Substring Cover Problem in Sublinear Space
On the Closest String via Rank Distance
Sorted Consecutive Occurrence Queries in Substrings
Faster Approximate Elastic-Degenerate String Matching - Part A
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings
Frequent Submap Discovery
A Coarse-to-Fine Approach to Computing the k -Best Viterbi Paths
The Problem of Context Sensitive String Matching
Efficient Selection of Unique and Popular Oligos for Large EST Databases
Finding Additive Biclusters with Random Background
A Fast and Small Subsampled R-Index
Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets
Cache-Oblivious Index for Approximate String Matching
Approximate Multiple Strings Search
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching
Finding Maximal Quasiperiodicities in Strings
Efficient Algorithms for Shortest Partial Seeds in Words
Converting SLP to LZ78 in almost Linear Time
Small Phylogeny Problem: Character Evolution Trees
A Simple Optimal Representation for Balanced Parentheses
A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem
Dynamic Dictionary Matching with Failure Functions (Extended Abstract)
Parallel Lempel Ziv Coding
Pattern Discovery in RNA Secondary Structure Using Affix Trees
Hybridization and Genome Rearrangement
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
Haplotype Inference Constrained by Plausible Haplotype Data
A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract)
Succinct Dictionary Matching with No Slowdown
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform
Approximate Matching in the L 1 Metric
New Results for the 2-Interval Pattern Problem
Multiple Alignment of Biological Networks: A Flexible Approach
On Maximal Repeats in Compressed Strings
Finding Compact Structural Motifs
A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
String Factorizations Under Various Collision Constraints
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
Tiling Periodicity
On-Line Construction of Compact Directed Acyclic Word Graphs
An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC)
The Normalized Edit Distance with Uniform Operation Costs Is a Metric
Shift-And Approach to Pattern Matching in LZW Compressed Text
New Algorithms for Text Fingerprinting
Efficient Parallel Algorithms for Tree Editing Problems
A Polynominal Time Approximation Scheme for the Closest Substring Problem
30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, Italy, June 18-20, 2019
LCP Magic
Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings
A Lempel-Ziv Text Index on Secondary Storage
Maintaining the Size of LZ77 on Semi-Dynamic Strings
Optimal Rank and Select Queries on Dictionary-Compressed Text
A New Class of Searchable and Provably Highly Compressible String Transformations
Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions
How to Exploit Periodicity (Invited Talk)
MONI Can Find k-MEMs
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
Finding Witnesses by Peeling
Polynomial-Time Algorithms for Computing Characteristic Strings
From Bit-Parallelism to Quantum String Matching for Labelled Graphs
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time
Distributed Generation of Suffix Arrays
Sorting by Reversals in Subquadratic Time
Improving Static Compression Schemes by Alphabet Extension
External Memory Generalized Suffix and LCP Arrays Construction
Fast Identification of Approximately Matching Substrings
Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings
Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings
Finding Maximal Pairs with Bounded Gap
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Streaming Dictionary Matching with Mismatches
Extension and Faster Implementation of the GRP Transform for Lossless Compression
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints
Efficient Seeds Computation Revisited
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time
Approximate Matching in Weighted Sequences
Analysis of Tree Edit Distance Algorithms
Computation of Squares in a String (Preliminary Version)
Polynomial-time Algorithm for Computing Translocation Distance between Genomes
Fully-online Construction of Suffix Trees for Multiple Texts
Simple and Efficient LZW-Compressed Multiple Pattern Matching
A Trie-Based Approach for Compacting Automata
The Heaviest Induced Ancestors Problem Revisited
Asynchronous Pattern Matching
Real-Time Streaming String-Matching
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
Minimizing Phylogenetic Number to find Good Evolutionary Trees
A New Periodicity Lemma
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations
Computing Covers of 2D-Strings
Approximation Algorithms for Hamming Clustering Problems
Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)
Finding Common RNA Pseudoknot Structures in Polynomial Time
Computing Similarity between RNA Strings
Improved Sketching of Hamming Distance with Error Correcting
Extracting Approximate Patterns
Longest Common Substring with Approximately k Mismatches
An Efficient Algorithm for Generating Super Condensed Neighborhoods
Fixed Topology Alignment with Recombination
A Linear Delay Algorithm for Building Concept Lattices
Optimizing Restriction Site Placement for Synthetic Genomes
Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees
Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings
Maximum Agreement and Compatible Supertrees (Extended Abstract)
Efficient Text Mining with Optimized Pattern Discovery
Range Minimum Query Indexes in Higher Dimensions
Multiple Sequence Comparison: A Peptide Matching Approach
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
On-Line Pattern Matching on D-Texts (Invited Talk)
Tractability and Approximability of Maximal Strip Recovery
On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem
Optimal Omnitig Listing for Safe and Complete Contig Assembly
Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
Maximum Motif Problem in Vertex-Colored Graphs
Machine Learning for Efficient Natural-Language Processing
Fast Lightweight Suffix Array Construction and Checking
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties
Estimating Statistics on Words Using Ambiguous Descriptions
Complexities of the Centre and Median String Problems
Weighted Ancestors in Suffix Trees Revisited
Edit Distance with Move Operations
Sparse and Truncated Suffix Trees on Variable-Length Codes
Stringology Combats Microbiological Threats (Invited Talk)
Finding the Anticover of a String
Approximate Dictionary Queries
Faster and Space-Optimal Edit Distance "1" Dictionary
Grammatical Tree Matching
The Complexity of String Partitioning
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)
From Regular Expressions to DFA's Using Compressed NFA's
Encoding Co-Lex Orders of Finite-State Automata in Linear Space
A Framework for Space-Efficient String Kernels
Algorithms for Three Versions of the Shortest Common Superstring Problem
A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search
Linear Bidirectional On-Line Construction of Affix Trees
Online LZ77 Parsing and Matching Statistics with RLBWTs
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process
Back-To-Front Online Lyndon Forest Construction
Fast Multi-dimensional Approximate Pattern Matching
Tuning String Matching for Huge Pattern Sets
Finding Approximate and Constrained Motifs in Graphs
Extended Islands of Tractability for Parsimony Haplotyping
Approximate Pattern Matching in Directed Graphs
Computing the LCP Array of a Labeled Graph
Analysis of the Size of Antidictionary in
Minimization of Sequential Transducers
On the k-Closest Substring and k-Consensus Pattern Problems
Genome Analysis: Pattern Search in Biological Macromolecules
Browsing around a Digital Library: Today and Tomorrow
Linear-Time Construction of Suffix Arrays
Incomplete Directed Perfect Phylogeny
Distributed and Paged Suffix Trees for Large Genetic Databases
Compressed Subsequence Matching and Packed Tree Coloring
Fingerprint Clustering with Bounded Number of Missing Values
Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings
Unary Words Have the Smallest Levenshtein k-Neighbourhoods
A Fast Filtration Algorithm for the Substring Matching Problem
Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding
Statistical Identification of Uniformly Mutated Segments within Repeats
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture)
Reconstructing General Matching Graphs
Algorithms for Finding a Most Similar Subforest
A New Indexing Method for Approximate String Matching
Dualities in Tree Representations
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms
Arbitrary-Length Analogs to de Bruijn Sequences
Counting on General Run-Length Grammars
A New Editing based Distance between Unordered Labeled Trees
An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
Simple Real-Time Constant-Space String Matching
Simple Optimal String Matching Algorithm
Computing the Burrows-Wheeler Transform of a String and Its Reverse
New Complexity Bounds for Image Matching under Rotation and Scaling
Cartesian Tree Subsequence Matching
A New Flexible Algorithm for the Longest Common Subsequence Problem
Using Suffix Trees for Gapped Motif Discovery
Approximating Shortest Superstring Problem Using de Bruijn Graphs
Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors
A Linear-Time Algorithm for the Copy Number Transformation Problem
Inferring a Graph from Path Frequency
Merging Sorted Lists of Similar Strings
On Hardness of Several String Indexing Problems
CPM's 20th Anniversary: A Statistical Retrospective
On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings
Suffix Arrays on Words
Edit Distances for Genome Comparisons Based on Non-Local Operations
Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms
Approximation of Grammar-Based Compression via Recompression
Computing Discoveries in Molecular Biology (Abstract)
Substring Range Reporting
Can We Recover the Cover?
Finding All Sorting Tandem Duplication Random Loss Operations
Encoding Nearest Larger Values
Three-Dimensional Pattern Matching in Protein Structure Analysis
Pseudo-realtime Pattern Matching: Closing the Gap
On Maximal Unbordered Factors
Finite-State Computability of Annotations of Strings and Trees
Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings
Efficient String Matching on Coded Texts
Algorithmic Aspects of Speech Recognition: A Synopsis
The k-Mappability Problem Revisited
Local Search for String Problems: Brute Force Is Essentially Optimal
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
Common Subsequences and Supersequences and Their expected Length
Approximate String Matching with Address Bit Errors
FL-RMQ: A Learned Approach to Range Minimum Queries
Discrete Methods for Image Analysis Applied to Molecular Biology
The Maximum Number of Squares in a Tree
The Longest Filled Common Subsequence Problem
Matching Patterns of An Automaton
A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score
A Double Combinatorial Approach to Discovering Patterns in Biological Sequences
Longest Common Extensions in Trees
Constructing NFA s by Optimal Use of Positions in Regular Expressions
Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation
String Range Matching
A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding
Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings
Trie-Based Data Structures for Sequence Assembly
Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings
Some Results on Flexible-Pattern Discovery
Linear-Space LCS Enumeration for Two Strings
Smaller Representations for Finite-State Transducers and Finite-State Automata
Lightweight BWT Construction for Very Large String Collections
Beyond Adjacency Maximization: Scaffold Filling for New String Distances
Data Structures for Categorical Path Counting Queries
An Improved Algorithm for Generalized Comparison of Minisatellites
Combinatorial Pattern Matching, 8th Annual Symposium, CPM 97, Aarhus, Denmark, June 30 - July 2, 1997, Proceedings
Suffix Cactus: A Cross between Suffix Tree and Suffix Array
A Faster Algorithm for Approximate String Matching
ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
An Improved Query Time for Succinct Dynamic Dictionary Matching
Fuzzy Hamming Distance: A New Dissimilarity Measure
On Suboptimal Alignments of Biological Sequences
Space-Efficient Algorithms for Document Retrieval
Efficient Randomized Dictionary Matching Algorithms (Extended Abstract)
Optimal Construction of Hierarchical Overlap Graphs
Synergistic Solutions on MultiSets
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, July 4-6, 2017
On-Line Pattern Matching on Similar Texts
Finding Biclusters by Random Projections
Identification of Distinguishing Motifs
Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality
Generating a Cyclic 2-Gray Code for Lucas Words in Constant Amortized Time
Prefix-Free Regular-Expression Matching
Palindrome Pattern Matching
Shortest Common Superstrings for Strings of Random Letters
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings
Counting Colours in Compressed Strings
MUL-Tree Pruning for Consistency and Compatibility
Suffix-Prefix Queries on a Dictionary
Efficient Algorithms for Finding Submasses in Weighted Strings
Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs
An Optimal Algorithm for Online Square Detection
Succinct Data Structures for Segments
Succincter Text Indexing with Wildcards
On Almost Monge All Scores Matrices
Efficient Lyndon Factorization of Grammar Compressed Text
Assessing the Significance of Sets of Words
Path Queries on Functions
Multiple Genome Alignment: Chaining Algorithms Revisited
Superstrings with multiplicities
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)
A Dynamic Edit Distance Table
Optimizing Multiple Spaced Seeds for Homology Search
Faster Longest Common Extension Queries in Strings over General Alphabets
A Simpler Analysis of Burrows-Wheeler Based Compression
Approximate Regular Expression Pattern Matching with Concave Gap Penalties
On Minimizing Pattern Splitting in Multi-track String Matching
Order-Preserving Squares in Strings
Encoding Two-Dimensional Range Top-k Queries
Reversal Distances for Strings with Few Blocks or Small Alphabets
More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk)
3-D Docking of Protein Molecules
The Equivalence Problem of E-Pattern Languages with Length Constraints Is Undecidable
Iterative versus simultaneous Multiple Sequence Alignment (Abstract)
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
The Compression of Subsegments of Images Described by Finite Automata
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
On a Technique for Parsing a String (Abstract)
On the Readability of Overlap Digraphs
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
Algorithms on Grammar-Compressed Strings
Recompression of SLPs
Quasi-distinct Parsing and Optimal Compression Methods
Beyond the Longest Letter-Duplicated Subsequence Problem
Modeling and Algorithmic Challenges in Online Social Networks
Faster Two Dimensional Scaled Matching
Multiple Sequence Comparison and n-Dimensional Image Reconstruction
Approximate Cover of Strings
On Combinatorial Generation of Prefix Normal Words
Computing Palindromic Factorizations and Palindromic Covers On-line
Efficient Algorithms for Regular Expression Constrained Sequence Alignment
A Compact Mathematical Programming Formulation for DNA Motif Finding
Finding Longest Common Segments in Protein Structures in Nearly Linear Time
Compressed Text Indexes with Fast Locate
Approximate String Matching with Don't Care Characters
Longest Lyndon Substring After Edit
Lempel-Ziv Factorization Revisited
On the DCJ Median Problem
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
Efficient Experimental String Matching by Weak Factor Recognition
Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract)
Stringology: Some Classic and Some Modern Problems
Better Filtering with Gapped q-Grams
Estimating the Probability of Approximate Matches
Partitioning into Colorful Components by Minimum Edge Deletions
Tight Bounds for Compressing Substring Samples
Mod/Resc Parsimony Inference
An Efficient Algorithm for Developing Topological Valid Matchings
Can a permutation be sorted by best short swaps?
Optimal Near-Linear Space Heaviest Induced Ancestors
DNA Compression Challenge Revisited: A Dynamic Programming Approach
Constructing Computer Virus Phylogenies
Partial Permutations Comparison, Maintenance and Applications
An Invertible Transform for Efficient String Matching in Labeled Digraphs
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem
On the Complexity of Comparing Evolutionary Trees (Extended Abstract)
Fast Sorting by Reversal
Reoptimization of the Shortest Common Superstring Problem
Periods and Quasiperiods Characterization
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String
A Linear Tree Edit Distance Algorithm for Similar Ordered Trees
The Asymmetric Median Tree - A New model for Building Consensus Trees
Document Listing on Repetitive Collections
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques
From Indexing Data Structures to de Bruijn Graphs
Three Heuristics for delta-Matching: delta-BM Algorithms
Chaining with Overlaps Revisited
Minimal Generators in Optimal Time
On the Editing Distance between Undirected Acyclic Graphs and Related Problems
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure
Matching a Set of Strings with Variable Length Don't Cares
Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings
On the Longest Common Rigid Subsequence Problem
Parallel External Memory Suffix Sorting
Text Indexing and Searching in Sublinear Time
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
Parametric Recomuting in Alignment Graphs
Compressed Compact Suffix Arrays