Minimal Discriminating Words Problem Revisited

No abstract is available for this paper.

• Publication year

  2013

• Venue

  SPIRE

• Publication date

  2013-10-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-02432-5_17
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computing Discriminating and Generic Words

  2012cited by this paper
• Extracting Powers and Periods in a String from Its Runs Structure

  2010cited by this paper
• On dynamic range reporting in one dimension

  2005cited by this paper
• Efficient algorithms for document retrieval problems

  2002cited by this paper
• Optimal static range reporting in one dimension

  2001cited by this paper
• LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings

  2000cited by this paper
• The LCA Problem Revisited

  2000cited by this paper
• Color Set Size Problem with Application to String Matching

  1992cited by this paper
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths

  1990cited by this paper
• On Finding Lowest Common Ancestors: Simplification and Parallelization

  1988cited by this paper

• Efficient tree-structured categorical retrieval

  2020cites this paper
• An Improved Data Structure for Left-Right Maximal Generic Words Problem

  2019cites this paper
• Computing Left-Right Maximal Generic Words

  2015cites this paper
• Succinct indexes for reporting discriminating and generic words

  2014cites this paper