StringologyTimes

SPIRE for Stringologist

SPIRE 2024

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

SPIRE 2023

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

SPIRE 2022

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

SPIRE 2021

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

SPIRE 2020

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

SPIRE 2019

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

SPIRE 2018

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

SPIRE 2017

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

SPIRE 2016

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

SPIRE 2015

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

SPIRE 2014

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

SPIRE 2013

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

SPIRE 2012

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

SPIRE 2011

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

SPIRE 2010

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

SPIRE 2009

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

SPIRE 2008

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

SPIRE 2007

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

SPIRE 2006

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

SPIRE 2005

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

SPIRE 2004

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

SPIRE 2003

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

SPIRE 2002

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

SPIRE 2001

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

SPIRE 2000

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

SPIRE 1998

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