Skip to main content
SpringerLink
Log in

Identifying Occurrences of Maximal Pairs in Multiple Strings

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2373))

Included in the following conference series:

Abstract

A molecular sequence “model” is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the “Model Matching” and “Model Identification” problems.

Partially supported by Royal Society, Wellcome and NATO grants

C. Makris was partially supported by a Royal Society grant

Partially supported by a Royal Society grant

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Apostolico and Z. Galil. Pattern Matching Algorithms. Oxford University Press, ISBN 0-19-611367-5, 1997.

    Google Scholar 

  2. G. S. Brodal, R. B. Lyngs, C. N. Storm Pedersen and DKFZ Jens Stoye. Finding Maximal Pairs with Bounded Gaps. Journal of Discrete Algorithms, 0(0):1–27, 2000.

    Google Scholar 

  3. M. R. Brown and R. E. Tarjan. A Fast Merging Algorithm. Journal of the ACM, 26(2):211–226, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. R. Brown and R. E. Tarjan. Design and Analysis of a Data Structure for Rep-resenting Sorted Lists. SIAM Journal on Computing, 9:594–614, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, ISBN 0-521-58519-8, 1999.

    Google Scholar 

  6. G. Navarro. A Guided Tour to Approximate String Matching. ACM Computing Surveys, 33(1):31–88, 2001.

    Article  Google Scholar 

  7. G. A. Stephen. String Searching Algorithms. Lecture Notes Series on Computing-Vol. 3, World Scientific Publishing, ISBN 981-02-1829-X, 1994.

    Google Scholar 

  8. E. Ukkonen. Finding Approximate atterns in strings. Journal of Algorithms, 6:132–137, 1985.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, King’s College London, London, WC2R 2LS, England

    Costas S. Iliopoulos

  2. Computer Engineering & Informatics Dept., Univesity of Patras and Research Academic Computer Tecnology Institute (RACTI), Rio, Greece, P.O. BOX 26500

    Christos Makris, Spiros Sioutas & Kostas Tsichlas

  3. Computer Engineering & Informatics Dept., Univesity of Patras and Research Academic Computer Tecnology Institute (RACTI), Rio, Greece, P.O. BOX 26500

    Athanasios Tsakalidis

Authors
  1. Costas S. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Makris
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Spiros Sioutas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Athanasios Tsakalidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kostas Tsichlas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrial Engineering and Computer Science, University of Padova, Via Gradenigo 6/A, 35131, Padova, Italy

    Alberto Apostolico

  2. Department of Informatics, Kyushu University, Fukuoka 812-8581, Japan

    Masayuki Takeda

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iliopoulos, C.S., Makris, C., Sioutas, S., Tsakalidis, A., Tsichlas, K. (2002). Identifying Occurrences of Maximal Pairs in Multiple Strings. In: Apostolico, A., Takeda, M. (eds) Combinatorial Pattern Matching. CPM 2002. Lecture Notes in Computer Science, vol 2373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45452-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45452-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43862-5

  • Online ISBN: 978-3-540-45452-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation