StringologyTimes

SPIRE for Stringologist

SPIRE 2025

  1. Massively Parallel Computation of Matching Statistics.
  2. Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings.
  3. Counting Distinct (Non-)crossing Substrings.
  4. Testing Quasiperiodicity.
  5. Two-Player Communication Complexity of Pattern Matching.
  6. Faster Algorithm for Bounded Damerau-Levenshtein Distance.
  7. Cache-Friendly Compressed Boolean Matrices.
  8. KeBaB: k-mer Based Breaking for Finding Long MEMs.
  9. On the Number of MUSs Crossing a Position.
  10. String Matching with a Dynamic Pattern.
  11. Longest Unbordered Factors on Run-Length Encoded Strings.
  12. Analysing New Entropy Measures for Tries.
  13. Practical Algorithms for Hierarchical Overlap Graphs.
  14. Smallest Suffixient Sets as a Repetitiveness Measure.
  15. Dorst-Smeulders Coding for Arbitrary Binary Words.
  16. Nyldon Factorization of Thue-Morse Words and Fibonacci Words.
  17. Depth First Representations of k2-trees.
  18. String Consensus Problems with Swaps and Substitutions.
  19. REINDEER2: Practical Abundance Index at Scale.
  20. Tight Additive Sensitivity on LZ-Style Compressors and String Attractors.
  21. Efficient Computation of Closed Substrings.
  22. RLZ-r and LZ-End-r: Enhancing Move-r.
  23. Prefix-Free Parsing for Merging Big BWTs.

SPIRE 2024

  1. Quantum Algorithms for Longest Common Substring with a Gap.
  2. LZ78 Substring Compression with CDAWGs.
  3. Indexing Finite-State Automata Using Forward-Stable Partitions.
  4. Simultaneously Building and Reconciling a Synteny Tree.
  5. Another Virtue of Wavelet Forests.
  6. Space-Efficient SLP Encoding for O(log N)-Time Random Access.
  7. Compressed Graph Representations for Evaluating Regular Path Queries.
  8. Adaptive Dynamic Bitvectors.
  9. On Computing the Smallest Suffixient Set.
  10. Burst Edit Distance.
  11. All-Pairs Suffix-Prefix on Dynamic Set of Strings.
  12. Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings.
  13. Simple Linear-Time Repetition Factorization.
  14. Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations.
  15. Faster Computation of Chinese Frequent Strings and Their Net Frequencies.
  16. Bounded-Ratio Gapped String Indexing.
  17. 2d Side-Sharing Tandems with Mismatches.
  18. Bijective BWT Based Compression Schemes.
  19. Generalization of Repetitiveness Measures for Two-Dimensional Strings.
  20. Online Computation of String Net Frequency.
  21. Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts.
  22. Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words.
  23. Computing String Covers in Sublinear Time.
  24. Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings.
  25. Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets.
  26. On the Number of Non-equivalent Parameterized Squares in a String.

SPIRE 2023

  1. Evaluating Regular Path Queries on Compressed Adjacency Matrices.
  2. Computing All-vs-All MEMs in Grammar-Compressed Text.
  3. Non-overlapping Indexing in BWT-Runs Bounded Space.
  4. Dynamic Compact Planar Embeddings.
  5. Longest Common Prefix Arrays for Succinct k-Spectra.
  6. Compressibility Measures for Two-Dimensional Data.
  7. On the Number of Factors in the LZ-End Factorization.
  8. CAGE: Cache-Aware Graphlet Enumeration.
  9. Sublinear Time Lempel-Ziv (LZ77) Factorization.
  10. Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph.
  11. On Suffix Tree Detection.
  12. Compacting Massive Public Transport Data.
  13. Data Structures for SMEM-Finding in the PBWT.
  14. Space-Time Trade-Offs for the LCP Array of Wheeler DFAs.
  15. Engineering a Textbook Approach to Index Massive String Dictionaries.
  16. Frequency-Constrained Substring Complexity.
  17. Largest Repetition Factorization of Fibonacci Words.
  18. A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings.
  19. Constant Time and Space Updates for the Sigma-Tau Problem.
  20. String Covers of a Tree Revisited.
  21. From de Bruijn Graphs to Variation Graphs - Relationships Between Pangenome Models.
  22. Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem.
  23. Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study.
  24. Chaining of Maximal Exact Matches in Graphs.
  25. Binary Mixed-Digit Data Compression Codes.
  26. Optimal Wheeler Language Recognition.
  27. New Advances in Rightmost Lempel-Ziv.
  28. Approximate Cartesian Tree Matching: An Approach Using Swaps.
  29. Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings.
  30. Efficient Parameterized Pattern Matching in Sublinear Space.
  31. Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems.

SPIRE 2022

  1. KATKA: A KRAKEN-Like Tool with k Given at Query Time.
  2. Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays.
  3. Pattern Matching Under DTW Distance.
  4. The Complexity of the Co-occurrence Problem.
  5. Sorting Genomes by Prefix Double-Cut-and-Joins.
  6. Genome Comparison on Succinct Colored de Bruijn Graphs.
  7. On the Optimisation of the GSACA Suffix Array Construction Algorithm.
  8. Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads.
  9. Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs.
  10. Matching Patterns with Variables Under Edit Distance.
  11. Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors.
  12. On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs.
  13. Maximal Closed Substrings.
  14. Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions.
  15. How Train-Test Leakage Affects Zero-Shot Retrieval.
  16. On the Hardness of Computing the Edit Distance of Shallow Trees.
  17. Accessing the Suffix Array via φ -1-Forest.
  18. Compressed String Dictionaries via Data-Aware Subtrie Compaction.
  19. Substring Complexities on Run-Length Compressed Strings.
  20. Balancing Run-Length Straight-Line Programs.
  21. Computing the Parameterized Burrows-Wheeler Transform Online.
  22. Subsequence Covers of Words.
  23. Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries.

SPIRE 2021

  1. Computing the Original eBWT Faster, Simpler, and with Less Memory.
  2. On the Approximation Ratio of LZ-End to LZ77.
  3. All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent.
  4. Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree.
  5. findere: Fast and Precise Approximate Membership Query.
  6. Longest Common Rollercoasters.
  7. An LMS-Based Grammar Self-index with Local Consistency Properties.
  8. Grammar Index by Induced Suffix Sorting.
  9. Improved Topic Modeling in Twitter Through Community Pooling.
  10. Exploiting Pseudo-locality of Interchange Distance.
  11. Position Heaps for Cartesian-Tree Matching on Strings and Tries.
  12. Lower Bounds for the Number of Repetitions in 2D Strings.
  13. A Separation of γ and b via Thue-Morse Words.
  14. String Covers of a Tree.
  15. On Stricter Reachable Repetitiveness Measures.
  16. r-Indexing the eBWT.
  17. Permutation-Constrained Common String Partitions with Applications.
  18. Minimal Unique Palindromic Substrings After Single-Character Substitution.
  19. Unicode at Gigabytes per Second.
  20. TSXor: A Simple Time Series Compression Algorithm.

SPIRE 2020

  1. Navigating Forest Straight-Line Programs in Constant Time.
  2. Efficient Enumeration of Distinct Factors Using Package Representations.
  3. Longest Square Subsequence Problem Revisited.
  4. Tailoring r-index for Document Listing Towards Metagenomics Applications.
  5. Computing Covers Under Substring Consistent Equivalence Relations.
  6. Approximating the Anticover of a String.
  7. Internal Quasiperiod Queries.
  8. A Comparison of Empirical Tree Entropies.
  9. On Repetitiveness Measures of Thue-Morse Words.
  10. Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction.
  11. Relative Lempel-Ziv Compression of Suffix Arrays.
  12. Efficient Construction of Hierarchical Overlap Graphs.
  13. Smaller Fully-Functional Bidirectional BWT Indexes.
  14. Lyndon Words, the Three Squares Lemma, and Primitive Squares.
  15. Multidimensional Period Recovery.
  16. An Efficient Elastic-Degenerate Text Index? Not Likely.
  17. Practical Random Access to SLP-Compressed Texts.
  18. Towards Efficient Interactive Computation of Dynamic Time Warping Distance.
  19. Pre-indexing Pruning Strategies.
  20. Contextual Pattern Matching.
  21. Measuring Controversy in Social Networks Through NLP.

SPIRE 2019

  1. Range Shortest Unique Substring Queries.
  2. Fast Identification of Heavy Hitters by Cached and Packed Group Testing.
  3. Lossless Image Compression Using List Update Algorithms.
  4. Minimal Absent Words in Rooted and Unrooted Trees.
  5. Weighted Shortest Common Supersequence Problem Revisited.
  6. Fast Cartesian Tree Matching.
  7. Fast, Small, and Simple Document Listing on Repetitive Text Collections.
  8. Online Algorithms on Antipowers and Antiperiods.
  9. Faster Dynamic Compressed d-ary Relations.
  10. BM25 Beyond Query-Document Similarity.
  11. Space-Efficient Merging of Succinct de Bruijn Graphs.
  12. Compact Data Structures for Shortest Unique Substring Queries.
  13. Adaptive Succinctness.
  14. COBS: A Compact Bit-Sliced Signature Index.
  15. Inducing the Lyndon Array.
  16. Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees.
  17. On Longest Common Property Preserved Substring Queries.
  18. Polynomial-Delay Enumeration of Maximal Common Subsequences.
  19. Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce Search.
  20. Searching Runs in Streams.
  21. SACABench: Benchmarking Suffix Array Construction.
  22. Space- and Time-Efficient Storage of LiDAR Point Clouds.
  23. Parallel External Memory Wavelet Tree and Wavelet Matrix Construction.
  24. Run-Length Encoding in a Finite Universe.
  25. Implementing the Topological Model Succinctly.
  26. An Index for Sequencing Reads Based on the Colored de Bruijn Graph.
  27. Bounds and Estimates on the Average Edit Distance.
  28. An Optimal Algorithm to Find Champions of Tournament Graphs.
  29. A Practical Alphabet-Partitioning Rank/Select Data Structure.
  30. Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.
  31. Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings.
  32. Linear Time Maximum Segmentation Problems in Column Stream Model.
  33. A New Linear-Time Algorithm for Centroid Decomposition.
  34. Network-Based Pooling for Topic Modeling on Microblog Content.
  35. Rpair: Rescaling RePair with Rsync.
  36. On the Computation of Longest Previous Non-overlapping Factors.

SPIRE 2018

  1. Longest Property-Preserved Common Factor.
  2. Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.
  3. Recoloring the Colored de Bruijn Graph.
  4. Early Commenting Features for Emotional Reactions Prediction.
  5. New Structures to Solve Aggregated Queries for Trips over Public Transportation Networks.
  6. Longest Common Prefixes with k-Errors and Applications.
  7. Adaptive Computation of the Discrete Fréchet Distance.
  8. Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation.
  9. On Extended Special Factors of a Word.
  10. Block Palindromes: A New Generalization of Palindromes.
  11. Towards a Compact Representation of Temporal Rasters.
  12. Optimal In-Place Suffix Sorting.
  13. Computing Burrows-Wheeler Similarity Distributions for String Collections.
  14. Truncated DAWGs and Their Application to Minimal Absent Word Problem.
  15. Fast Wavelet Tree Construction in Practice.
  16. Compressed Range Minimum Queries.
  17. Efficient Computation of Sequence Mappability.
  18. Maximal Motif Discovery in a Sliding Window.
  19. Better Heuristic Algorithms for the Repetition Free LCS and Other Variants.
  20. Trickier XBWT Tricks.
  21. Fast and Effective Neural Networks for Translating Natural Language into Denotations.
  22. Searching for a Modified Pattern in a Changing Text.
  23. Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.
  24. Faster Recovery of Approximate Periods over Edit Distance.
  25. Compressed Communication Complexity of Longest Common Prefixes.
  26. The Colored Longest Common Prefix Array Computed via Sequential Scans.
  27. 3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories.
  28. Faster and Smaller Two-Level Index for Network-Based Trajectories.

SPIRE 2017

  1. Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries.
  2. Greedy Shortest Common Superstring Approximation in Compact Space.
  3. Tight Bounds for Top Tree Compression.
  4. LZ78 Compression in Low Main Memory Space.
  5. Detecting One-Variable Patterns.
  6. Optimal Skeleton Huffman Trees.
  7. Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries.
  8. Listing Maximal Independent Sets with Minimal Space and Bounded Delay.
  9. Pattern Matching on Elastic-Degenerate Text with Errors.
  10. On Suffix Tree Breadth.
  11. Longest Common Factor After One Edit Operation.
  12. Fast Label Extraction in the CDAWG.
  13. Fast Construction of Compressed Web Graphs.
  14. Mining Bit-Parallel LCS-length Algorithms.
  15. Efficient Compression and Indexing of Trajectories.
  16. Order Preserving Pattern Matching on Trees and DAGs.
  17. A Self-index on Block Trees.
  18. On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
  19. Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract).
  20. Lightweight BWT and LCP Merging via the Gap Algorithm.
  21. Faster Practical Block Compression for Rank/Select Dictionaries.
  22. Succinct Partial Sums and Fenwick Trees.
  23. Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression.
  24. Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings.
  25. Distinct Squares in Circular Words.
  26. Counting Palindromes in Substrings.

SPIRE 2016

  1. RLZAP: Relative Lempel-Ziv with Adaptive Pointers.
  2. Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array.
  3. Compact Trip Representation over Networks.
  4. LCP Array Construction Using O(sort(n)) (or Less) I/Os.
  5. Fragmented BWT: An Extended BWT for Full-Text Indexing.
  6. AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching.
  7. Fast Classification of Protein Structures by an Alignment-Free Kernel.
  8. The Smallest Grammar Problem Revisited.
  9. Lexical Matching of Queries and Ads Bid Terms in Sponsored Search.
  10. Analyzing Relative Lempel-Ziv Reference Construction.
  11. Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes.
  12. Longest Common Abelian Factors and Large Alphabets.
  13. XBWT Tricks.
  14. Bookmarks in Grammar-Compressed Strings.
  15. GraCT: A Grammar Based Compressed Representation of Trajectories.
  16. Inverse Range Selection Queries.
  17. Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
  18. A Linear-Space Algorithm for the Substring Constrained Alignment Problem.
  19. Parallel Lookups in String Indexes.
  20. Maximal Unbordered Factors of Random Strings.
  21. Pattern Matching for Separable Permutations.
  22. Fully Dynamic de Bruijn Graphs.
  23. Efficient Representation of Multidimensional Data over Hierarchical Domains.
  24. Parallel Computation for the All-Pairs Suffix-Prefix Problem.
  25. Dynamic and Approximate Pattern Matching in 2D.

SPIRE 2015

  1. DeShaTo: Describing the Shape of Cumulative Topic Distributions to Rank Retrieval Systems Without Relevance Judgments.
  2. Selective Labeling and Incomplete Label Mitigation for Low-Cost Evaluation.
  3. Improved Practical Compact Dynamic Tries.
  4. Adaptive Computation of the Swap-Insert Correction Distance.
  5. Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract).
  6. Sampling the Suffix Array with Minimizers.
  7. Online Self-Indexed Grammar Compression.
  8. Induced Sorting Suffixes in External Memory with Better Design and Less Space.
  9. Parallel Construction of Succinct Representations of Suffix Tree Topologies.
  10. Filtration Algorithms for Approximate Order-Preserving Matching.
  11. Fishing in Read Collections: Memory Efficient Indexing for Sequence Assembly.
  12. Temporal Query Classification at Different Granularities.
  13. Faster Exact Search Using Document Clustering.
  14. A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.
  15. Beyond the Runs Theorem.
  16. Assessing the Efficiency of Suffix Stripping Approaches for Portuguese Stemming.
  17. A Compact RDF Store Using Suffix Arrays.
  18. On Prefix/Suffix-Square Free Words.
  19. ShRkC: Shard Rank Cutoff Prediction for Selective Search.
  20. Relative Select.
  21. Evaluating Geographical Knowledge Re-Ranking, Linguistic Processing and Query Expansion Techniques for Geographical Information Retrieval.
  22. Efficient Algorithms for Longest Closed Factor Array.
  23. How Big is that Genome? Estimating Genome Size and Coverage from k-mer Abundance Spectra.
  24. Range LCP Queries Revisited.
  25. Prefix and Suffix Reversals on Strings.
  26. Computing the Longest Unbordered Substring.
  27. Longest Common Prefix with Mismatches.
  28. Space-Efficient Detection of Unusual Words.
  29. Fast Online Lempel-Ziv Factorization in Compressed Space.
  30. Efficient Term Set Prediction Using the Bell-Wigner Inequality.
  31. Transforming XML Streams with References.
  32. Feasibility of Word Difficulty Prediction.
  33. Temporal Analysis of CHAVE Collection.
  34. Tight Bound for the Number of Distinct Palindromes in a Tree.

SPIRE 2014

  1. Relative FM-Indexes.
  2. Indexed Matching Statistics and Shortest Unique Substrings.
  3. A Compressed Suffix-Array Strategy for Temporal-Graph Indexing.
  4. Grammar Compressed Sequences with Rank/Select Support.
  5. Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.
  6. Online Multiple Palindrome Pattern Matching.
  7. Relative Lempel-Ziv with Constant-Time Random Access.
  8. Order Preserving Prefix Tables.
  9. Shortest Unique Queries on Strings.
  10. Succinct Indexes for Reporting Discriminating and Generic Words.
  11. Simple and Efficient String Algorithms for Query Suggestion Metrics Computation.
  12. On the String Consensus Problem and the Manhattan Sequence Consensus Problem.
  13. Efficient Compressed Indexing for Approximate Top-k String Retrieval.
  14. A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction Task.
  15. I/O-Efficient Dictionary Search with One Edit Error.
  16. Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections.
  17. Context-Aware Deal Size Prediction.
  18. Information-Theoretic Term Selection for New Item Recommendation.
  19. Efficient Indexing and Representation of Web Access Logs.
  20. Fast Construction of Wavelet Trees.
  21. Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time.
  22. K 2-Treaps: Range Top-k Queries in Compact Space.
  23. Online Pattern Matching for String Edit Distance with Moves.
  24. Improved Filters for the Approximate Suffix-Prefix Overlap Problem.
  25. Strategic Pattern Search in Factor-Compressed Text.
  26. Sequence Decision Diagrams.

SPIRE 2013

  1. Learning URL Normalization Rules Using Multiple Alignment of Sequences.
  2. Pattern Discovery and Listing in Graphs.
  3. You Are What You Eat: Learning User Tastes for Rating Prediction.
  4. Suffix Array of Alignment: A Practical Index for Similar Data.
  5. Faster Range LCP Queries.
  6. Discovering Dense Subgraphs in Parallel for Compressing Web and Social Networks.
  7. Space-Efficient Construction of the Burrows-Wheeler Transform.
  8. Top-k Color Queries on Tree Paths.
  9. Query Processing in Highly-Loaded Search Engines.
  10. Efficient Approximation of Edit Distance.
  11. Faster Top-k Document Retrieval in Optimal Space.
  12. Document Listing on Versioned Documents.
  13. Simulation Study of Multi-threading in Web Search Engine Processors.
  14. Adaptive Data Structures for Permutations and Binary Relations.
  15. Adding Compression and Blended Search to a Compact Two-Level Suffix Array.
  16. A Lempel-Ziv Compressed Structure for Document Listing.
  17. Compact Querieable Representations of Raster Data.
  18. Solving Graph Isomorphism Using Parameterized Matching.
  19. Using Mutual Influence to Improve Recommendations.
  20. Lossless Compression of Rotated Maskless Lithography Images.
  21. Learning to Schedule Webpage Updates Using Genetic Programming.
  22. Minimal Discriminating Words Problem Revisited.
  23. Position-Restricted Substring Searching over Small Alphabets.
  24. On Two-Dimensional Lyndon Words.
  25. Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text.
  26. Nowcasting with Google Trends.
  27. Consolidating and Exploring Information via Textual Inference.
  28. Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.
  29. Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.
  30. Fully-Online Grammar Compression.
  31. Accurate Profiling of Microbial Communities from Massively Parallel Sequencing Using Convex Optimization.
  32. Distributed Query Processing on Compressed Graphs Using K2-Trees.

SPIRE 2012

  1. Clustering Heterogeneous Data with Mutual Semi-supervision.
  2. A Study on Novelty Evaluation in Biomedical Information Retrieval.
  3. Approximate Period Detection and Correction.
  4. Grammar Precompression Speeds Up Burrows-Wheeler Compression.
  5. Improved Address-Calculation Coding of Integer Arrays.
  6. Computing Discriminating and Generic Words.
  7. Computing Maximum Number of Runs in Strings.
  8. Active Microbloggers: Identifying Influencers, Leaders and Discussers in Microblogging Networks.
  9. Fast Multiple String Matching Using Streaming SIMD Extensions Technology.
  10. Semantic Document Representation: Do It with Wikification.
  11. Improved Grammar-Based Compressed Indexes.
  12. Parallel Suffix Array Construction for Shared Memory Architectures.
  13. Configurations and Minority in the String Consensus Problem.
  14. Temporal Web Image Retrieval.
  15. A Zipf-Like Distant Supervision Approach for Multi-document Summarization Using Wikinews Articles.
  16. Impact of Regionalization on Performance of Web Search Engine Result Caches.
  17. Characterization and Extraction of Irredundant Tandem Motifs.
  18. Position-Aligned Translation Model for Citation Recommendation.
  19. The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences.
  20. Smaller Self-indexes for Natural Language.
  21. Efficient LZ78 Factorization of Grammar Compressed Text.
  22. Approximate Function Matching under δ- and γ- Distances.
  23. Dual-Sorted Inverted Lists in Practice.
  24. Efficient Data Structures for the Factor Periodicity Problem.
  25. Method of Mining Subtopics Using Dependency Structure and Anchor Texts.
  26. Basic Word Completion and Prediction for Hebrew.
  27. Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings.
  28. Compressed Representation of Web and Social Networks via Dense Subgraphs.
  29. Parikh Matching in the Streaming Model.
  30. Relevance Feedback Method Based on Vector Space Basis Change.
  31. Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences.
  32. The Position Heap of a Trie.
  33. Efficient Bubble Enumeration in Directed Graphs.
  34. Compressed Suffix Trees for Repetitive Texts.
  35. Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time.
  36. Eager XPath Evaluation over XML Streams.
  37. Experiments on Pseudo Relevance Feedback Using Graph Random Walks.
  38. Variable-Length Codes for Space-Efficient Grammar-Based Compression.
  39. Ranked Document Retrieval in (Almost) No Space.
  40. Usage Data in Web Search: Benefits and Limitations.
  41. Collection Ranking and Selection for Federated Entity Search.
  42. The Wavelet Matrix.

SPIRE 2011

  1. Constructing Strings at the Nano Scale via Staged Self-assembly.
  2. Cross-Lingual Text Fragment Alignment Using Divergence from Randomness.
  3. Fast q-gram Mining on SLP Compressed Strings.
  4. External Query Reformulation for Text-Based Image Retrieval.
  5. Approximate Regular Expression Matching with Multi-strings.
  6. Compressed Indexes for Aligned Pattern Matching.
  7. A Learned Approach for Ranking News in Real-Time Using the Blogosphere.
  8. Query-Sets + + : A Scalable Approach for Modeling Web Sites.
  9. Improved Compressed Indexes for Full-Text Document Retrieval.
  10. Computing All Subtree Repeats in Ordered Ranked Trees.
  11. Spaced Seeds Design Using Perfect Rulers.
  12. Candidate Document Retrieval for Web-Scale Text Reuse Detection.
  13. Detecting Health Events on the Social Web to Enable Epidemic Intelligence.
  14. Discounted Cumulative Gain and User Decision Models.
  15. Weighted Shortest Common Supersequence.
  16. Navigating the User Query Space.
  17. On-Line Construction of Position Heaps.
  18. On Suffix Extensions in Suffix Trees.
  19. Succinct Gapped Suffix Arrays.
  20. A Multi-faceted Approach to Query Intent Classification.
  21. Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem.
  22. Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform.
  23. Compressed Text Indexing with Wildcards.
  24. Approximate Point Set Pattern Matching with L p -Norm.
  25. Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract).
  26. Finding Frequent Elements in Compressed 2D Arrays and Strings.
  27. Fixed Block Compression Boosting in FM-Indexes.
  28. A New Approach for Verifying URL Uniqueness in Web Crawlers.
  29. Indexing with Gaps.
  30. Sparse Spatial Selection for Novelty-Based Search Result Diversification.
  31. Attribute Retrieval from Relational Web Tables.
  32. COCA Filters: Co-occurrence Aware Bloom Filters.
  33. Persistency in Suffix Trees with Applications to String Interval Problems.
  34. A Succinct Index for Hypertext.
  35. Reference Sequence Construction for Relative Compression of Genomes.
  36. Approximations and Partial Solutions for the Consensus Sequence Problem.
  37. ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing.
  38. When Was It Written? Automatically Determining Publication Dates.
  39. Enhancing Document Snippets Using Temporal Information.
  40. A Knowledge-Based Semantic Kernel for Text Classification.
  41. Space Efficient Wavelet Tree Construction.

SPIRE 2010

  1. Evaluation of Query Performance Prediction Methods by Range.
  2. Extracting Powers and Periods in a String from Its Runs Structure.
  3. Faster Compressed Dictionary Matching.
  4. Succinct Representations of Dynamic Strings.
  5. Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems.
  6. Counting and Verifying Maximal Palindromes.
  7. Approximate String Matching with Stuck Address Bits.
  8. Multiplication Algorithms for Monge Matrices.
  9. Dynamic Z-Fast Tries.
  10. Compressed Self-indices Supporting Conjunctive Queries on Document Collections.
  11. Incremental Algorithms for Effective and Efficient Query Recommendation.
  12. Using Related Queries to Improve Web Search Results Ranking.
  13. Range Queries over Untangled Chains.
  14. Restricted LCS.
  15. On the Hardness of Counting and Sampling Center Strings.
  16. A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles.
  17. Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis.
  18. String Retrieval for Multi-pattern Queries.
  19. Text Comparison Using Soft Cardinality.
  20. Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval.
  21. Identifying SNPs without a Reference Genome by Comparing Raw Reads.
  22. On Tag Spell Checking.
  23. Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes.
  24. String Matching with Variable Length Gaps.
  25. Fast Bit-Parallel Matching for Network and Regular Expressions.
  26. On Shortest Common Superstring and Swap Permutations.
  27. Temporal Analysis of Document Collections: Framework and Applications.
  28. Why Large Closest String Instances Are Easy to Solve in Practice.
  29. The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching.
  30. A PTAS for the Square Tiling Problem.
  31. Querying the Web Graph - (Invited Talk).
  32. Training Parse Trees for Efficient VF Coding.
  33. Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy.
  34. CST++.
  35. Standard Deviation as a Query Hardness Estimator.
  36. Algorithms for Finding a Minimum Repetition Representation of a String.
  37. Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval.
  38. Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract).
  39. Improved Fast Similarity Search in Dictionaries.
  40. Colored Range Queries and Document Retrieval.
  41. Dual-Sorted Inverted Lists.

SPIRE 2009

  1. Fast Single-Pass Construction of a Half-Inverted Index.
  2. On-Line Construction of Parameterized Suffix Trees.
  3. A Compressed Enhanced Suffix Array Supporting Fast String Matching.
  4. Directly Addressable Variable-Length Codes.
  5. Generalised Matching.
  6. A Two-Level Structure for Compressing Aligned Bitexts.
  7. Range Quantile Queries: Another Virtue of Wavelet Trees.
  8. Faster Algorithms for Sampling and Counting Biological Sequences.
  9. The Frequent Items Problem, under Polynomial Decay, in the Streaming Model.
  10. Use of Co-occurrences for Temporal Expressions Annotation.
  11. A Linear-Time Burrows-Wheeler Transform Using Induced Sorting.
  12. Efficient Index for Retrieving Top-k Most Frequent Documents.
  13. Practical Algorithms for the Longest Common Extension Problem.
  14. Towards a Theory of Patches.
  15. Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees.
  16. On Entropy-Compressed Text Indexing in External Memory.
  17. A Task-Based Evaluation of an Aggregated Search Interface.
  18. Indexing Variable Length Substrings for Exact and Approximate Matching.
  19. Succinct Text Indexing with Wildcards.
  20. Improved Approximation Results on the Shortest Common Supersequence Problem.
  21. Novel and Generalized Sort-Based Transform for Lossless Data Compression.
  22. Efficient Language-Independent Retrieval of Printed Documents without OCR.
  23. A Comparison of Data-Driven Automatic Syllabification Methods.
  24. Syntactic Query Models for Restatement Retrieval.
  25. Expectation of Strings with Mismatches under Markov Chain Distribution.
  26. Identifying the Intent of a User Query Using Support Vector Machines.
  27. Two-Dimensional Distributed Inverted Files.
  28. On-Demand Associative Cross-Language Information Retrieval.
  29. A Last-Resort Semantic Cache for Web Queries.
  30. Consensus Optimizing Both Distance Sum and Radius.
  31. Set Intersection and Sequence Matching.
  32. k2-Trees for Compact Web Graph Representation.
  33. Compressed Suffix Arrays for Massive Data.
  34. Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems.

SPIRE 2008

  1. Mismatch Sampling.
  2. Practical Rank/Select Queries over Arbitrary Sequences.
  3. Faster Text Fingerprinting.
  4. Speeding Up Pattern Matching by Text Sampling.
  5. Context-Sensitive Grammar Transform: Compression and Pattern Matching.
  6. Self-indexing Natural Language.
  7. Approximated Pattern Matching with the L1, L2 and Linfinit Metrics.
  8. Some Approximations for Shortest Common Nonsubsequences and Supersequences.
  9. Approximate Runs - Revisited.
  10. Interchange Rearrangement: The Element-Cost Model.
  11. Improved Variable-to-Fixed Length Codes.
  12. Indexed Hierarchical Approximate String Matching.
  13. The Effect of Weighted Term Frequencies on Probabilistic Latent Semantic Term Relationships.
  14. New Perspectives on the Prefix Array.
  15. Comparison of s-gram Proximity Measures in Out-of-Vocabulary Word Translation.
  16. An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper).
  17. Clique Analysis of Query Log Graphs.
  18. On the Structure of Small Motif Recognition Instances.
  19. Engineering Radix Sort for Strings.
  20. “Search Is a Solved Problem” and Other Annoying Fallacies.
  21. Out of the Box Phrase Indexing.
  22. delta-gamma-Parameterized Matching.
  23. Pattern Matching with Pair Correlation Distance.
  24. Sliding CDAWG Perfection.
  25. Term Impacts as Normalized Term Frequencies for BM25 Similarity Scoring.
  26. Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection.
  27. Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.

SPIRE 2007

  1. Exploiting Genre in Focused Crawling.
  2. Approximating Constrained LCS.
  3. Tuning Approximate Boyer-Moore for Gene Sequences.
  4. A Pocket Guide to Web History.
  5. Enhancing Educational-Material Retrieval Using Authored-Lesson Metadata.
  6. Extending Weighting Models with a Term Quality Measure.
  7. A Fast and Compact Web Graph Representation.
  8. Jump-Matching with Errors.
  9. Approximate Swap and Mismatch Edit Distance.
  10. Implicit Compression Boosting with Applications to Self-indexing.
  11. Estimating Number of Citations Using Author Reputation.
  12. Prefix-Shuffled Geometric Suffix Tree.
  13. Compact Set Representation for Information Retrieval.
  14. Highly Frequent Terms and Sentence Retrieval.
  15. A Filtering Algorithm for k -Mismatch with Don’t Cares.
  16. A Web-Page Usage Prediction Scheme Using Weighted Suffix Trees.
  17. Admission Policies for Caches of Search Engine Results.
  18. Approximate String Matching with Lempel-Ziv Compressed Indexes.
  19. Generalized LCS.
  20. Local Transpositions in Alignment of Polyphonic Musical Sequences.
  21. Algorithms for Weighted Matching.
  22. Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage.
  23. Edge-Guided Natural Language Text Compression.
  24. Efficient Computations of l1 and linfinity Rearrangement Distances.
  25. Efficient Text Proximity Search.
  26. A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences.
  27. Indexing a Dictionary for Subset Matching Queries.

SPIRE 2006

  1. On-Line Repetition Detection.
  2. A Statistical Model of Query Log Generation.
  3. Cluster Generation and Cluster Labelling for Web Snippets: A Fast and Accurate Hierarchical Solution.
  4. Discovering Context-Topic Rules in Search Engine Logs.
  5. MP-Boost: A Multiple-Pivot Boosting Algorithm and Its Application to Text Categorization.
  6. Sparse Directed Acyclic Word Graphs.
  7. TreeBoost.MH: A Boosting Algorithm for Multi-label Hierarchical Text Categorization.
  8. A New Algorithm for Fast All-Against-All Substring Matching.
  9. Structured Index Organizations for High-Throughput Text Querying.
  10. Efficient Lazy Algorithms for Minimal-Interval Semantics.
  11. Adaptive Query-Based Sampling of Distributed Collections.
  12. Analyzing User Behavior to Rank Desktop Items.
  13. Mapping Words into Codewords on PPM.
  14. Phrase-Based Pattern Matching in Compressed Text.
  15. Principal Components for Automatic Term Hierarchy Building.
  16. A Compressed Self-index Using a Ziv-Lempel Dictionary.
  17. English to Persian Transliteration.
  18. Improving Usability Through Password-Corrective Hashing.
  19. Incremental Aggregation of Latent Semantics Using a Graph-Based Energy Model.
  20. Efficient Algorithms for Pattern Matching with General Gaps and Character Classes.
  21. The Intention Behind Web Queries.
  22. Dotted Suffix Trees A Structure for Approximate Text Indexing.
  23. Computing the Minimum Approximate lambda-Cover of a String.
  24. Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory.
  25. Word-Based Correction for Retrieval of Arabic OCR Degraded Documents.
  26. Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions.
  27. Using String Comparison in Context for Improved Relevance Feedback in Different Text Media.
  28. Compact Features for Detection of Near-Duplicates in Distributed Retrieval.
  29. Output-Sensitive Autocompletion Search.
  30. How to Compare Arc-Annotated Sequences: The Alignment Hierarchy.
  31. A Multiple Criteria Approach for Information Retrieval.

SPIRE 2005

  1. A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees.
  2. XML Retrieval with a Natural Language Interface.
  3. Normalized Similarity of RNA Sequences.
  4. Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array.
  5. Practical and Optimal String Matching.
  6. Lydia: A System for Large-Scale News Analysis.
  7. Measuring the Difficulty of Distance-Based Indexing.
  8. A Bilingual Linking Service for the Web.
  9. A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison.
  10. Evaluating Hierarchical Clustering of Search Results.
  11. Classifying Sentences Using Induced Structure.
  12. Fast Plagiarism Detection System.
  13. Cache-Conscious Collision Resolution in String Hash Tables.
  14. Recommending Better Queries from Click-Through Data.
  15. Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity.
  16. A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching.
  17. Stemming Arabic Conjunctions and Prepositions.
  18. An Edit Distance Between RNA Stem-Loops.
  19. Towards Real-Time Suffix Tree Construction.
  20. Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity.
  21. Retrieval Status Values in Information Retrieval Evaluation.
  22. Composite Pattern Discovery for PCR Application.
  23. A Model for Information Retrieval Based on Possibilistic Networks.
  24. L1 Pattern Matching Lower Bound.
  25. Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces.
  26. Application of Clustering Technique in Multiple Sequence Alignment.
  27. Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences.
  28. Restricted Transposition Invariant Approximate String Matching Under Edit Distance.
  29. N-Gram Similarity and Distance.
  30. Necklace Swap Problem for Rhythmic Similarity Measures.
  31. A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting.
  32. Faster Generation of Super Condensed Neighbourhoods Using Finite Automata.
  33. Counting Suffix Arrays and Strings.
  34. Approximate Matching in the Linfinity Metric.
  35. Enhanced Byte Codes with Restricted Prefix Properties.
  36. Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty.
  37. XML Multimedia Retrieval.
  38. Deriving TF-IDF as a Fisher Kernel.
  39. A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC’s.
  40. Linear Time Algorithm for the Generalised Longest Common Repeat Problem.
  41. Rank-Sensitive Data Structures.
  42. Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem.
  43. Comparison of Representations of Multiple Evidence Using a Functional Framework for IR.
  44. Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups.

SPIRE 2004

  1. Processing Conjunctive and Phrase Queries with the Set-Based Model.
  2. Motif Extraction from Weighted Sequences.
  3. A Space-Saving Linear-Time Algorithm for Grammar-Based Compression.
  4. Automatic Document Categorization Based on k-NN and Object-Based Thesauri.
  5. On Asymptotic Finite-State Error Repair.
  6. Evaluation of Web Page Representations by Content Through Clustering.
  7. Negations and Document Length in Logical Retrieval.
  8. An Alphabet-Friendly FM-Index.
  9. On the Transformation Distance Problem.
  10. Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS.
  11. Automaton-Based Sublinear Keyword Pattern Matching.
  12. Linear Time Algorithm for the Longest Common Repeat Problem.
  13. Longest Motifs with a Functionally Equivalent Central Block.
  14. Metric Indexing for the Vector Model in Text Retrieval.
  15. An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size.
  16. Fast Detection of Common Sequence Structure Patterns in RNAs.
  17. Cross-Comparison for Two-Dimensional Text Categorization.
  18. An Improvement and an Extension on the Hybrid Index for Approximate String Matching.
  19. Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays.
  20. Information Extraction by Embedding HMM to the Set of Induced Linguistic Features.
  21. Permuted and Scaled String Matching.
  22. First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index.
  23. Searching XML Documents Using Relevance Propagation.
  24. Simple, Fast, and Efficient Natural Language Adaptive Compression..
  25. Techniques for Efficient Query Expansion.
  26. A Scalable System for Identifying Co-derivative Documents.
  27. Metric Indexes for Approximate String Matching in a Dictionary.
  28. Efficient One Dimensional Real Scaled Matching.
  29. Dealing with Syntactic Variation Through a Locality-Based Approach.
  30. On Classification of Strings.
  31. A New Feature Normalization Scheme Based on Eigenspace for Noisy Speech Recognition.
  32. Concurrency Control and I/O-Optimality in Bulk Insertion..
  33. An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem.
  34. Simple Implementation of String B-Trees..
  35. New Algorithms for Finding Monad Patterns in DNA Sequences.
  36. Finding Cross-Lingual Spelling Variants.
  37. DDOC: Overlapping Clustering of Words for Document Classification.
  38. Linear Nondeterministic Dawg String Matching Algorithm.
  39. Searching for a Set of Correlated Patterns.
  40. Indexing Text Documents Based on Topic Identification.
  41. Efficient Computation of Balancedness in Binary Sequence Generators.
  42. Inferring Query Performance Using Pre-retrieval Predictors..
  43. Alphabet Permutation for Differentially Encoding Text.
  44. Efficient Extraction of Structured Motifs Using Box-Links.

SPIRE 2003

  1. Current Challenges in Bioinformatics.
  2. New Refinement Techniques for Longest Common Subsequence Algorithms.
  3. BFT: Bit Filtration Technique for Approximate String Join in Biological Databases.
  4. Bit-Parallel Approximate String Matching Algorithms with Transposition.
  5. A Three Level Search Engine Index Based in Query Log Distribution.
  6. Improving Text Retrieval in Medical Collections Through Automatic Categorization.
  7. Alternative Algorithms for Bit-Parallel String Matching.
  8. Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model.
  9. Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm.
  10. SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases.
  11. A Practical Index for Genome Searching.
  12. Distributed Query Processing Using Suffix Arrays.
  13. A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.
  14. (S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases.
  15. FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm.
  16. French Noun Phrase Indexing and Mining for an Information Retrieval System.
  17. What’s Changed? Measuring Document Change in Web Crawling for Search Engines.
  18. Processing of Huffman Compressed Texts with a Super-Alphabet.
  19. An Empirical Comparison of Text Categorization Methods.
  20. Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants.
  21. Patterns on the Web.
  22. The Size of Subsequence Automaton.
  23. The Implementation and Evaluation of a Lexicon-Based Stemmer.
  24. Memory-Adaptive Dynamic Spatial Approximation Trees.
  25. Using WordNet for Word Sense Disambiguation to Support Concept Map Construction.
  26. Linear-Time Off-Line Text Compression by Longest-First Substitution.
  27. Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval.
  28. Large Edit Distance with Multiple Block Operations.
  29. Link Information as a Similarity Measure in Web Classification.

SPIRE 2002

  1. String Matching with Metric Trees Using an Approximate Distance.
  2. Pattern Matching over Multi-attribute Data Streams.
  3. Tree Pattern Matching for Linear Static Terms.
  4. Web Structure, Dynamics and Page Quality.
  5. Focussed Structured Document Retrieval.
  6. Towards a More Comprehensive Comparison of Collaborative Filtering Algorithms.
  7. From Searching Text to Querying XML Streams.
  8. Efficient Computation of Long Similar Subsequences.
  9. The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives.
  10. Java MARIAN: From an OPAC to a Modern Digital Library System.
  11. A Theoretical Analysis of Google’s PageRank.
  12. Multiple Example Queries in Content-Based Image Retrieval.
  13. A Framework for Generating Attribute Extractors for Web Data Sources.
  14. Sorting by Prefix Transpositions.
  15. Stemming Galician Texts.
  16. Faster String Matching with Super-Alphabets.
  17. t-Spanners as a Data Structure for Metric Space Searching.
  18. Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
  19. Indexing Text Using the Ziv-Lempel Trie.
  20. On the Size of DASG for Multiple Texts.
  21. Probabilistic Proximity Searching Algorithms Based on Compact Partitions.
  22. Compact Directed Acyclic Word Graphs for a Sliding Window.
  23. Firing Policies for an Arabic Rule-Based Stemmer.
  24. Machine Learning Approach for Homepage Finding Task.
  25. Optimal Exact Strring Matching Based on Suffix Arrays.
  26. Fully Dynamic Spatial Approximation Trees.
  27. Enhancing the Set-Based Model Using Proximity Information.
  28. String Matching Problems from Bioinformatics Which Still Need Better Solutions (Extended Abstract).

SPIRE 2001

  1. A Stemming Algorithmm for the Portuguese Language.
  2. Storing Semistructured Data in Relational Databases.
  3. Of Maps Bigger than the Empire (Invited Paper).
  4. Evaluation of N-grams Conflation Approach in Text-Based Information Retrieval.
  5. Semantic Labeling - Unveiling the Main Components of Meaning of Free-Text (Invited Paper).
  6. Using Edit Distance in Point-Pattern Matching.
  7. Speed-up of Aho-Corasick Pattern Matching Machines by Rearranging States.
  8. Adding Security to Compressed Information Retrieval Systems.
  9. Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy.
  10. On Compression of Parse Trees.
  11. A Comparative Study of Topic Identification on Newspaper and E-mail.
  12. On Using Two-Phase Filtering in Indexed Approximate String Matching with Application to Searching Unique Oligonucleotides.
  13. Compaction Techniques for Nextword Indexes.
  14. Semantic Thesaurus for Automatic Expanded Query in Information Retrieval.
  15. A Subquadratic Algorithm for Cluster and Outlier Detection in Massive Metric Data.
  16. On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
  17. Re-Store: A System for Compressing, Browsing, and Searching Large Documents (Invited Paper).
  18. A Model for the Representation and Focussed Retrieval of Structured Documents Based on Fuzzy Aggregation.
  19. Fast Categorisation of Large Document Collections.
  20. Musical Sequence Comparison for Melodic and Rhythmic Similarities.
  21. Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
  22. An Efficient Bottom-Up Distance between Trees.
  23. Distributed Query Processing Using Partitioned Inverted Files.
  24. A Documental Database Query Language.
  25. Design of a Graphical User Interface for Structured Documents Retrieval.
  26. Using Semantics for Paragraph Selection in Question Answering Systems.
  27. Relating Web Characteristics with Link Based Web Page Ranking.
  28. Exact Distribution of Deletion Sizes for Unavoidable Strings.

SPIRE 2000

  1. Fast Multipattern Search Algorithms for Intrusion Detection.
  2. A New Approach for Approximating the Tranposition Distance.
  3. Automatic Construction of Rule-Based Trees for Conceptual Retrieval.
  4. Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.
  5. NFAs with Tagged Transitions, Their Conversion to Deterministic Automata and Application to Regular Expressions.
  6. Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images.
  7. A Survey of Longest Common Subsequence Algorithms.
  8. Experiment Analysis in Newspaper Topic Detection.
  9. Online Construction of Subsequence Automata for Multiple Texts.
  10. An Image Similarity Measure Based on Graph Matching.
  11. Virtual Test Tubes: A New Methodology for Computing.
  12. A Word Stemming Algorithm for the Spanish Language.
  13. Adding String Processing Capabilities to Data Management Systems.
  14. New Approaches to Information Management: Attribute-Centric Data Systems (invited paper).
  15. Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW.
  16. A Model and Software Architecture for Search Results Visualization on the WWW.
  17. DNA Processing in Ciliates - A Computational Point of View (invited abstract).
  18. Hybrid Protein Model (HPM): A Method to Compact Protein 3D-Structure Information and Physicochemical Properties.
  19. Parallel Search Using Partitioned Inverted Files.
  20. Learning Profile in Routing: Comparison between Relevance and Gradient Back-Propagation.
  21. An Effective Clustering Algorithm to Index High Dimensional Metric Spaces.
  22. Finding Repeats with Fixed Gap.
  23. Prosodic Stress and Topic Detection in Spoken Sentences.
  24. Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs.
  25. Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays.
  26. A PRAM-on-Chip Vision (invited abstract).
  27. Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
  28. DelfosnetX: A Workbench for XML-Based Information Retrieval Systems.
  29. Computing with Membranes: P Systems with Worm-Objects.
  30. Muninn: A Pragmatic Information Extraction System.
  31. Implementing Document Ranking within a Logical Framework.

SPIRE 1998

  1. Efficient Search Techniques for the Inference of Minimum Size Finite Automata.
  2. Evidence Accumulation with Competition in Information Retrieval.
  3. In-Place Length-Restricted Prefix Coding.
  4. A Model and a Visual Query Language for Structured Text.
  5. Reversal and Transposition Distance of Linear Chromosomes.
  6. A Linear Time Lower Bound on Updating Algorithms for Suffix Trees.
  7. Searching the Web: Challenges and Partial Solutions (Invited Paper).
  8. An Experiment Stemming Non-Traditional Text.
  9. New Approximation Algorithms for Longest Common Subsequences.
  10. Direct Pattern Matching on Compressed Text.
  11. Fast Approximate String Matching in a Dictionary.
  12. Information Overload - An IR Problem?
  13. SST versus EST in Gene Recognition (Invited Paper).
  14. Hyperdictionary: A Knowledge Discovery Tool to Help Information Retrieval.
This site is open source. Improve this page.