Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2001)

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

Included in the following conference series:

Abstract

A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues on computational complexity related to the matching of fragmentary patterns. We show that the fragmentary pattern matching problem is NP-complete, and the problem to find a fragmentary pattern common to two strings that maximizes the pattern score is NP-hard. Moreover, we propose a polynomialtime approximation algorithm for the fragmentary pattern matching, and show that it achieves a constant worst-case approximation ratio if either the strings in a pattern have the same length, or the importance weights of strings in a pattern are proportional to their lengths.

This research is partially supported by Grants-in-Aid for Encouragement of Young Scientists, Japan Society for the Promotion of Science, No. 12780286.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. D. Angluin. Finding patterns common to a set of strings. J. Comput. Sys. Sci., 21:46–62, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  2. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87–106, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  3. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319–342, 1988.

    MathSciNet  Google Scholar 

  4. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer-Verlag, Berlin, 1999.

    Book  MATH  Google Scholar 

  5. G. Ausiello, P. Crescenzi, and M. Protasi. Approximate solution of NP optimization problems. Theor. Comput. Sci., 150: 1–55, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  6. A. Z. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences (SEQUENCES’97), pages 21–29, 1997.

    Google Scholar 

  7. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994.

    MATH  Google Scholar 

  8. M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman & Co., New York, 1979.

    MATH  Google Scholar 

  9. G. Das, R. Fleischer, L. Gasieniec, D. Gunopulos, and J. Karkkainen. Episode Matching. In Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM’97), pages 12–27, 1997.

    Google Scholar 

  10. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York, 1997.

    Book  MATH  Google Scholar 

  11. T. Kadota, M. Hirao, A. Ishino, M. Takeda, A. Shinohara, and F. Matsuo. Musical sequence comparison for melodic and rhythmic similarities. In Proc. 8th International Symposium on String Processing and Information Retrieval (SPIRE2001), 2001, to appear.

    Google Scholar 

  12. S. Shimozono, H. Arimura, and S. Arikawa. Efficient discovery of optimal wordassociation patterns in large databases. New Gener. Comput., 18(1):49–60, 2000.

    Article  Google Scholar 

  13. M. Takeda, T. Fukuda, I. Nanri, M. Yamasaki, and K. Tamari. Discovering instances of poetic allusion from anthologies of classical Japanese poems. Theor. Comput. Sci., 2001, to appear.

    Google Scholar 

  14. K. Yamamoto, M. Takeda, A. Shinohara, T. Fukuda, and I. Nanri. Discovering repetitive expressions and affinities from anthologies of classical Japanese poems. In Proc. 4th International Conference on Discovery Science (DS2001), 2001, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hori, H., Shimozono, S., Takeda, M., Shinohara, A. (2001). Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-45678-3_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42985-2

  • Online ISBN: 978-3-540-45678-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics