IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v5y2001i1d10.1023_a1009897903540.html
   My bibliography  Save this article

Efficient Algorithms for Similarity Search

Author

Listed:
  • S. Rajasekaran

    (University of Florida)

  • Y. Hu

    (University of Florida)

  • J. Luo

    (University of Florida)

  • H. Nick

    (University of Florida)

  • P.M. Pardalos

    (University of Florida)

  • S. Sahni

    (University of Florida)

  • G. Shaw

    (University of Florida)

Abstract

The problem of our interest takes as input a database of m sequences from an alphabet Σ and an integer k. The goal is to report all the pairs of sequences that have a matching subsequence of length at least k. We employ two algorithms to solve this problem. The first algorithm is based on sorting and the second is based on generalized suffix trees. We provide experimental data comparing the performances of these algorithms. The generalized suffix tree based algorithm performs better than the sorting based algorithm.

Suggested Citation

  • S. Rajasekaran & Y. Hu & J. Luo & H. Nick & P.M. Pardalos & S. Sahni & G. Shaw, 2001. "Efficient Algorithms for Similarity Search," Journal of Combinatorial Optimization, Springer, vol. 5(1), pages 125-132, March.
    • Handle: RePEc:spr:jcomop:v:5:y:2001:i:1:d:10.1023_a:1009897903540
    DOI: 10.1023/A:1009897903540
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009897903540
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009897903540?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Blum, Christian & Lozano, José A. & Davidson, Pinacho, 2015. "Mathematical programming strategies for solving the minimum common string partition problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 769-777.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:5:y:2001:i:1:d:10.1023_a:1009897903540. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.