yusuke1997/dblp-id-title huggingface dataset:
Parallel Construction of Succinct Representations of Suffix Tree Topologies
Fast Classification of Protein Structures by an Alignment-Free Kernel
Filtration Algorithms for Approximate Order-Preserving Matching
Compressed Indexes for Aligned Pattern Matching
Detecting One-Variable Patterns
Actor-Oriented Management of Cooperative Work
Improving Text Retrieval in Medical Collections Through Automatic Categorization
Automaton-Based Sublinear Keyword Pattern Matching
Space-Efficient SLP Encoding for O(log N)-Time Random Access
An LMS-Based Grammar Self-index with Local Consistency Properties
Efficient Lazy Algorithms for Minimal-Interval Semantics
On Compression of Parse Trees
A Framework for the Development of Educational-Collaborative Applications Based on Social Constructivism
Classifying Sentences Using Induced Structure
Block Palindromes: A New Generalization of Palindromes
Towards a Compact Representation of Temporal Rasters
Alternative Algorithms for Bit-Parallel String Matching
The Smallest Grammar Problem Revisited
Range Quantile Queries: Another Virtue of Wavelet Trees
Focussed Structured Document Retrieval
Faster Range LCP Queries
A Model and a Visual Query Language for Structured Text
Active Microbloggers: Identifying Influencers, Leaders and Discussers in Microblogging Networks
Efficient Enumeration of Distinct Factors Using Package Representations
Longest Square Subsequence Problem Revisited
Optimal Skeleton Huffman Trees
Online Multiple Palindrome Pattern Matching
Dynamic Z-Fast Tries
A Comparative Study of Topic Identification on Newspaper and E-mail
Fishing in Read Collections: Memory Efficient Indexing for Sequence Assembly
Adaptive Query-Based Sampling of Distributed Collections
The Complexity of the Co-occurrence Problem
On Using Two-Phase Filtering in Indexed Approximate String Matching with Application to Searching Unique Oligonucleotides
Extending Weighting Models with a Term Quality Measure
Discovering Dense Subgraphs in Parallel for Compressing Web and Social Networks
Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces
Experiment Analysis in Newspaper Topic Detection
BM25 Beyond Query-Document Similarity
Online Construction of Subsequence Automata for Multiple Texts
Linear Time Algorithm for the Longest Common Repeat Problem
Towards a More Comprehensive Comparison of Collaborative Filtering Algorithms
Temporal Query Classification at Different Granularities
Reversal and Transposition Distance of Linear Chromosomes
Space-Efficient Merging of Succinct de Bruijn Graphs
Faster Exact Search Using Document Clustering
Compaction Techniques for Nextword Indexes
Longest Motifs with a Functionally Equivalent Central Block
Lexical Matching of Queries and Ads Bid Terms in Sponsored Search
On the Number of MUSs Crossing a Position
Metric Indexing for the Vector Model in Text Retrieval
Faster Algorithms for Sampling and Counting Biological Sequences
Semantic Thesaurus for Automatic Expanded Query in Information Retrieval
An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size
Fast Plagiarism Detection System
From Searching Text to Querying XML Streams
Compressed Graph Representations for Evaluating Regular Path Queries
String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings
An Image Similarity Measure Based on Graph Matching
Analyzing Relative Lempel-Ziv Reference Construction
Fast Detection of Common Sequence Structure Patterns in RNAs
Adaptive Dynamic Bitvectors
Space-Efficient Construction of the Burrows-Wheeler Transform
On Computing the Smallest Suffixient Set
Sorting Genomes by Prefix Double-Cut-and-Joins
A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String
Compact Data Structures for Shortest Unique Substring Queries
A Fast and Compact Web Graph Representation
Jump-Matching with Errors
Approximate Swap and Mismatch Edit Distance
An Efficient Uniform-Cost Normalized Edit Distance Algorithm
Adaptive Succinctness
Computing Burrows-Wheeler Similarity Distributions for String Collections
Self-indexing Natural Language
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
An Efficient Method for in Memory Construction of Suffix Arrays
Top-k Color Queries on Tree Paths
Approximated Pattern Matching with the L1, L2 and L infinit Metrics
Dynamic Compact Planar Embeddings
Grammar Index by Induced Suffix Sorting
Longest Common Abelian Factors and Large Alphabets
Compressed Self-indices Supporting Conjunctive Queries on Document Collections
Fast Multiple String Matching Using Streaming SIMD Extensions Technology
XBWT Tricks
Longest Common Prefix Arrays for Succinct k-Spectra
A Learned Approach for Ranking News in Real-Time Using the Blogosphere
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model
COBS: A Compact Bit-Sliced Signature Index
Some Approximations for Shortest Common Nonsubsequences and Supersequences
String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings
Genome Comparison on Succinct Colored de Bruijn Graphs
Implicit Compression Boosting with Applications to Self-indexing
Inducing the Lyndon Array
Use of Co-occurrences for Temporal Expressions Annotation
Approximate Runs - Revisited
Query Processing in Highly-Loaded Search Engines
Cache-Conscious Collision Resolution in String Hash Tables
Contextual Array Splicing Systems
Approximate Retrieval from Multimedia Databases Using Relevance Feedback
String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings
Cross-Comparison for Two-Dimensional Text Categorization
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
Incremental Algorithms for Effective and Efficient Query Recommendation
A Linear Time Lower Bound on Updating Algorithms for Suffix Trees
String Matching with a Dynamic Pattern
Truncated DAWGs and Their Application to Minimal Absent Word Problem
Interchange Rearrangement: The Element-Cost Model
Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model
Longest Unbordered Factors on Run-Length Encoded Strings
Recommending Better Queries from Click-Through Data
Compressibility Measures for Two-Dimensional Data
Efficient Approximation of Edit Distance
Efficient Index for Retrieving Top-k Most Frequent Documents
Improved Variable-to-Fixed Length Codes
Improved Topic Modeling in Twitter Through Community Pooling
Bookmarks in Grammar-Compressed Strings
Faster Top-k Document Retrieval in Optimal Space
Using Related Queries to Improve Web Search Results Ranking
Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees
On the Optimisation of the GSACA Suffix Array Construction Algorithm
String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings
Order Preserving Prefix Tables
Analysing New Entropy Measures for Tries
An Improvement and an Extension on the Hybrid Index for Approximate String Matching
Shortest Unique Queries on Strings
Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads
Practical Algorithms for the Longest Common Extension Problem
Concurrency and Recovery in Full-Text Indexing
Practical Algorithms for Hierarchical Overlap Graphs
Exploiting Pseudo-locality of Interchange Distance
Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs
Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity
A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching
Stemming Arabic Conjunctions and Prepositions
On the Number of Factors in the LZ-End Factorization
Semantic Document Representation: Do It with Wikification
Beyond the Runs Theorem
Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm
Query-Sets + + : A Scalable Approach for Modeling Web Sites
Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
An Edit Distance Between RNA Stem-Loops
Matching Patterns with Variables Under Edit Distance
SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000
Improved Grammar-Based Compressed Indexes
Range Queries over Untangled Chains
Fast Wavelet Tree Construction in Practice
Information Extraction by Embedding HMM to the Set of Induced Linguistic Features
Assessing the Efficiency of Suffix Stripping Approaches for Portuguese Stemming
Efficient Computation of Long Similar Subsequences
The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives
Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
Position Heaps for Cartesian-Tree Matching on Strings and Tries
Burst Edit Distance
Tailoring r-index for Document Listing Towards Metagenomics Applications
All-Pairs Suffix-Prefix on Dynamic Set of Strings
Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, September 21-24, 1999
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
Towards a Theory of Patches
Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings
Permuted and Scaled String Matching
Parallel Suffix Array Construction for Shared Memory Architectures
Smallest Suffixient Sets as a Repetitiveness Measure
Dorst-Smeulders Coding for Arbitrary Binary Words
CAGE: Cache-Aware Graphlet Enumeration
Document Listing on Versioned Documents
Analyzing User Behavior to Rank Desktop Items
Computing Covers Under Substring Consistent Equivalence Relations
Java MARIAN: From an OPAC to a Modern Digital Library System
Estimating Number of Citations Using Author Reputation
Pattern Matching on Elastic-Degenerate Text with Errors
Configurations and Minority in the String Consensus Problem
Simulation Study of Multi-threading in Web Search Engine Processors
Restricted LCS
A Theoretical Analysis of Google's PageRank
Prefix-Shuffled Geometric Suffix Tree
Temporal Web Image Retrieval
Approximating the Anticover of a String
Sublinear Time Lempel-Ziv (LZ77) Factorization
Towards Real-Time Suffix Tree Construction
Efficient Computation of Sequence Mappability
Mapping Words into Codewords on PPM
Phrase-Based Pattern Matching in Compressed Text
On Longest Common Property Preserved Substring Queries
A Zipf-Like Distant Supervision Approach for Multi-document Summarization Using Wikinews Articles
On Suffix Tree Breadth
Improved Compressed Indexes for Full-Text Document Retrieval
Compact Set Representation for Information Retrieval
Maximal Motif Discovery in a Sliding Window
Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity
Simple Linear-Time Repetition Factorization
Multiple Example Queries in Content-Based Image Retrieval
On the Hardness of Counting and Sampling Center Strings
Virtual Test Tubes: A New Methodology for Computing
Polynomial-Delay Enumeration of Maximal Common Subsequences
A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles
Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis
A Compact RDF Store Using Suffix Arrays
Principal Components for Automatic Term Hierarchy Building
A Word Stemming Algorithm for the Spanish Language
Impact of Regionalization on Performance of Web Search Engine Result Caches
Succinct Indexes for Reporting Discriminating and Generic Words
Retrieval Status Values in Information Retrieval Evaluation
Nyldon Factorization of Thue-Morse Words and Fibonacci Words
String Retrieval for Multi-pattern Queries
Characterization and Extraction of Irredundant Tandem Motifs
Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce Search
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
Adaptive Data Structures for Permutations and Binary Relations
On Prefix/Suffix-Square Free Words
On Suffix Tree Detection
Searching the Web: Challenges and Partial Solutions (Invited Paper)
Text Comparison Using Soft Cardinality
On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs
Longest Common Factor After One Edit Operation
Fast Label Extraction in the CDAWG
Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations
Internal Quasiperiod Queries
A Subquadratic Algorithm for Cluster and Outlier Detection in Massive Metric Data
Searching in Metric Spaces by Spatial Approximation
Computing All Subtree Repeats in Ordered Ranked Trees
Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval
Simple and Efficient String Algorithms for Query Suggestion Metrics Computation
ShRkC: Shard Rank Cutoff Prediction for Selective Search
Searching Runs in Streams
Position-Aligned Translation Model for Citation Recommendation
Fast Construction of Compressed Web Graphs
Adding Compression and Blended Search to a Compact Two-Level Suffix Array
A Practical Index for Genome Searching
A Fast Algorithm on Average for All-Against-All Sequence Matching
First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index
SACABench: Benchmarking Suffix Array Construction
Searching XML Documents Using Relevance Propagation
Compacting Massive Public Transport Data
CoBWeb - A Crawler for the Brazilian Web
A Lempel-Ziv Compressed Structure for Document Listing
Composite Pattern Discovery for PCR Application
A Compressed Self-index Using a Ziv-Lempel Dictionary
Better Heuristic Algorithms for the Repetition Free LCS and Other Variants
Adding String Processing Capabilities to Data Management Systems
Relative Select
Spaced Seeds Design Using Perfect Rulers
Compact Querieable Representations of Raster Data
GraCT: A Grammar Based Compressed Representation of Trajectories
Simple, Fast, and Efficient Natural Language Adaptive Compression.
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
Smaller Self-indexes for Natural Language
Identifying SNPs without a Reference Genome by Comparing Raw Reads
A Comparison of Empirical Tree Entropies
Distributed Query Processing Using Suffix Arrays
New Approaches to Information Management: Attribute-Centric Data Systems (invited paper)
An Experiment Stemming Non-Traditional Text
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs
Candidate Document Retrieval for Web-Scale Text Reuse Detection
Detecting Health Events on the Social Web to Enable Epidemic Intelligence
Data Structures for SMEM-Finding in the PBWT
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval
Depth First Representations of k 2 -trees
Discounted Cumulative Gain and User Decision Models
On Tag Spell Checking
On Entropy-Compressed Text Indexing in External Memory
Weighted Shortest Common Supersequence
Evaluating Geographical Knowledge Re-Ranking, Linguistic Processing and Query Expansion Techniques for Geographical Information Retrieval
Efficient Algorithms for Longest Closed Factor Array
Re-Store: A System for Compressing, Browsing, and Searching Large Documents (Invited Paper)
On Repetitiveness Measures of Thue-Morse Words
Mining Bit-Parallel LCS-length Algorithms
Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW
String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings
Techniques for Efficient Query Expansion
Space- and Time-Efficient Storage of LiDAR Point Clouds
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes
String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings
Efficient Compression and Indexing of Trajectories
A Model and Software Architecture for Search Results Visualization on the WWW
Inverse Range Selection Queries
A Model for Information Retrieval Based on Possibilistic Networks
L 1 Pattern Matching Lower Bound
String Consensus Problems with Swaps and Substitutions
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs
Navigating the User Query Space
Using the k -Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Application of Clustering Technique in Multiple Sequence Alignment
Solving Graph Isomorphism Using Parameterized Matching
(S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
Indexed Hierarchical Approximate String Matching
Faster Computation of Chinese Frequent Strings and Their Net Frequencies
String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings
New Approximation Algorithms for Longest Common Subsequences
String Matching with Variable Length Gaps
FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
A Scalable System for Identifying Co-derivative Documents
Run-Length Encoding in a Finite Universe
Highly Frequent Terms and Sentence Retrieval
Effects of Term Segmentation on Chinese/English Cross-Language Information Retrieval
Bounded-Ratio Gapped String Indexing
The Effect of Weighted Term Frequencies on Probabilistic Latent Semantic Term Relationships
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
A Filtering Algorithm for k -Mismatch with Don't Cares
A Task-Based Evaluation of an Aggregated Search Interface
English to Persian Transliteration
Order Preserving Pattern Matching on Trees and DAGs
A Model and Tool for Semi-Automatic Recording of Design Rationale in Software Diagrams
Metric Indexes for Approximate String Matching in a Dictionary
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction
Improving Usability Through Password-Corrective Hashing
Engineering a Textbook Approach to Index Massive String Dictionaries
On-Line Construction of Position Heaps
Indexing Variable Length Substrings for Exact and Approximate Matching
A Self-index on Block Trees
French Noun Phrase Indexing and Mining for an Information Retrieval System
Lower Bounds for the Number of Repetitions in 2D Strings
Incremental Aggregation of Latent Semantics Using a Graph-Based Energy Model
Implementing the Topological Model Succinctly
Efficient One Dimensional Real Scaled Matching
Fast Bit-Parallel Matching for Network and Regular Expressions
String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings
Efficient LZ78 Factorization of Grammar Compressed Text
Approximate Function Matching under δ- and γ- Distances
How Big is that Genome? Estimating Genome Size and Coverage from k-mer Abundance Spectra
String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings
A Separation of γ and b via Thue-Morse Words
An Index for Sequencing Reads Based on the Colored de Bruijn Graph
Relative Lempel-Ziv Compression of Suffix Arrays
String-Oriented Databases
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
Dual-Sorted Inverted Lists in Practice
New Perspectives on the Prefix Array
Comparison of s-gram Proximity Measures in Out-of-Vocabulary Word Translation
2d Side-Sharing Tandems with Mismatches
A Web-Page Usage Prediction Scheme Using Weighted Suffix Trees
Efficient Construction of Hierarchical Overlap Graphs
Succinct Text Indexing with Wildcards
Frequency-Constrained Substring Complexity
On the String Consensus Problem and the Manhattan Sequence Consensus Problem
DNA Processing in Ciliates - A Computational Point of View (invited abstract)
Improved Approximation Results on the Shortest Common Supersequence Problem
Cross-Domain Approximate String Matching
On Suffix Extensions in Suffix Trees
Range LCP Queries Revisited
Bounds for Parametric Sequence Comparison
What's Changed? Measuring Document Change in Web Crawling for Search Engines
Hybrid Protein Model (HPM): A Method to Compact Protein 3D-Structure Information and Physicochemical Properties
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes
On Shortest Common Superstring and Swap Permutations
Processing of Huffman Compressed Texts with a Super-Alphabet
Admission Policies for Caches of Search Engine Results
Efficient Algorithms for Pattern Matching with General Gaps and Character Classes
Succinct Gapped Suffix Arrays
REINDEER2: Practical Abundance Index at Scale
Direct Pattern Matching on Compressed Text
String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings
Efficient Data Structures for the Factor Periodicity Problem
N -Gram Similarity and Distance
An Empirical Comparison of Text Categorization Methods
A Multi-faceted Approach to Query Intent Classification
String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings
Efficient Compressed Indexing for Approximate Top-k String Retrieval
Linear Time Sorting of Skewed Distributions
A Model for the Representation and Focussed Retrieval of Structured Documents Based on Fuzzy Aggregation
An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper)
A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction Task
Temporal Analysis of Document Collections: Framework and Applications
Fast Categorisation of Large Document Collections
Largest Repetition Factorization of Fibonacci Words
A Framework for Generating Attribute Extractors for Web Data Sources
Fast Approximate String Matching in a Dictionary
Sorting by Prefix Transpositions
Necklace Swap Problem for Rhythmic Similarity Measures
I/O-Efficient Dictionary Search with One Edit Error
Prefix and Suffix Reversals on Strings
Smaller Fully-Functional Bidirectional BWT Indexes
Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections
Method of Mining Subtopics Using Dependency Structure and Anchor Texts
Context-Aware Deal Size Prediction
Bounds and Estimates on the Average Edit Distance
Why Large Closest String Instances Are Easy to Solve in Practice
Information Overload - An IR Problem?
Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants
An Optimal Algorithm to Find Champions of Tournament Graphs
Basic Word Completion and Prediction for Hebrew
Using Mutual Influence to Improve Recommendations
Bijective BWT Based Compression Schemes
Developing a Tool to Assist Electronic Facilitation of Decision-Making Groups
Computing the Longest Unbordered Substring
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
Top-down Extraction of Semi-Structured Data
Information-Theoretic Term Selection for New Item Recommendation
String Processing and Information Retrieval, 14th International Symposium, SPIRE 2007, Santiago, Chile, October 29-31, 2007, Proceedings
Patterns on the Web
Eighth International Symposium on String Processing and Information Retrieval, SPIRE 2001, Laguna de San Rafael, Chile, November 13-15, 2001
Efficient Indexing and Representation of Web Access Logs
A Linear-Space Algorithm for the Substring Constrained Alignment Problem
Near Optimal Multiple Sequence Alignments Using a Traveling Salesman Problem Approach
Stemming Galician Texts
Faster String Matching with Super-Alphabets
t-Spanners as a Data Structure for Metric Space Searching
Fast Construction of Wavelet Trees
Clique Analysis of Query Log Graphs
A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting
Generalization of Repetitiveness Measures for Two-Dimensional Strings