Faster index for property matching

@article{Iliopoulos2008FasterIF,
  title={Faster index for property matching},
  author={Costas S. Iliopoulos and Mohammad Sohel Rahman},
  journal={Inf. Process. Lett.},
  year={2008},
  volume={105},
  pages={218-223}
}
In this paper, we revisit the Property Matching problem studied by Amir et al. [Property Matching and Weighted Matching, CPM 2006] and present a better indexing scheme for the problem. In particular, the data structure by Amir et al., namely PST, requires O(n log |Σ|+ n log log n) construction time and O(m log |Σ|+ K) query time, where n and m are the length of, respectively, the text and the pattern, Σ is the alphabet and K is the output size. On the other hand, the construction time of our… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Property matching and weighted matching

  • A. Apostolico.
  • Theor . Comput . Sci .
  • 2007

Optimal suffix tree construction with large alphabets

  • M. Farach
  • In FOCS, pages 137–143,
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…