StringologyTimes

SPIRE for Stringologist

SPIRE 2023

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

SPIRE 2022

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

SPIRE 2021

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

SPIRE 2020

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

SPIRE 2019

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

SPIRE 2018

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

SPIRE 2017

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

SPIRE 2016

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

SPIRE 2015

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

SPIRE 2014

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

SPIRE 2013

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

SPIRE 2012

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

SPIRE 2011

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

SPIRE 2010

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

SPIRE 2009

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

SPIRE 2008

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

SPIRE 2007

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

SPIRE 2006

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

SPIRE 2005

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

SPIRE 2004

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

SPIRE 2003

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

SPIRE 2002

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

SPIRE 2001

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

SPIRE 2000

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

SPIRE 1998

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