Skip to main content
SpringerLink
Log in

Frequent Pattern Mining with Non-overlapping Inversions

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8977))

Abstract

Frequent pattern mining is widely used in bioinformatics since frequent patterns in bio sequences often correspond to residues conserved during evolution. In bio sequence analysis, non-overlapping inversions are well-studied because of their practical properties for local sequence comparisons. We consider the problem of finding frequent patterns in a bio sequence with respect to non-overlapping inversions, and design efficient algorithms.

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.

References

  1. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Record 22(2), 207–216 (1993)

    Article  Google Scholar 

  2. Amir, A., Porat, B.: Pattern matching with non overlapping reversals - approximation and on-line algorithms. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 55–65. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Cantone, D., Cristofaro, S., Faro, S.: Efficient string-matching allowing for non-overlapping inversions. Theoretical Computer Science 483(29), 85–95 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen, Z.Z., Gao, Y., Lin, G., Niewiadomski, R., Wang, Y., Wu, J.: A space-efficient algorithm for sequence alignment with inversions and reversals. Theoretical Computer Science 325(3), 361–372 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cho, D.-J., Han, Y.-S., Kang, S.-D., Kim, H., Ko, S.-K., Salomaa, K.: Pseudo-inversion on formal languages. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) UCNC 2014. LNCS, vol. 8553, pp. 93–104. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  6. Cho, D.J., Han, Y.S., Kim, H.: Alignment with non-overlapping inversions and translocations on two strings. Theoretical Computer Science (in press)

    Google Scholar 

  7. Harary, F.: Graph Theory. Addison-Wesley series in mathematics. Perseus Books (1994)

    Google Scholar 

  8. Ibarra, O.H.: On decidability and closure properties of language classes with respect to bio-operations. In: Murata, S., Kobayashi, S. (eds.) DNA 2014. LNCS, vol. 8727, pp. 148–160. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  9. Kruskal, Jr., J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7(1), 48–50 (1956)

    Google Scholar 

  10. Kum, H.C., Pei, J., Wang, W., Duncan, D.: Approxmap: Approximate mining of consensus sequential patterns. In: Proceedings of the 2nd SIAM International Conference on Data Mining, pp. 311–315 (2003)

    Google Scholar 

  11. Liao, V.C.C., Chen, M.S.: DFSP: a Depth-First SPelling algorithm for sequential pattern mining of biological sequences. Knowledge and Information Systems 38(3), 623–639 (2013)

    Article  Google Scholar 

  12. Liao, V.C.C., Chen, M.S.: Efficient mining gapped sequential patterns for motifs in biological sequences. BMC Systems Biology 7(4), 1–13 (2013)

    MathSciNet  Google Scholar 

  13. Lupski, J.R.: Genomic disorders: structural features of the genome can lead to DNA rearrangements and human disease traits. Trends in Genetics 14(10), 417–422 (1998)

    Article  Google Scholar 

  14. Sagot, M.-F.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 374–390. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Schöniger, M., Waterman, M.S.: A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology 54(4), 521–536 (1992)

    Article  MATH  Google Scholar 

  16. Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2008)

    Google Scholar 

  17. Vellozo, A.F., Alves, C.E.R., do Lago, A.P.: Alignment with non-overlapping inversions in \({O}(n^3)\)-time. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 186–196. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Wang, K., Xu, Y., Yu, J.X.: Scalable sequential pattern mining for biological sequences. In: Proceedings of the 13th ACM International Conference on Information and Knowledge Management, pp. 178–187 (2004)

    Google Scholar 

  19. Wood, D.: Theory of Computation. Harper & Row (1986)

    Google Scholar 

  20. Zhu, F., Yan, X., Han, J., Yu, P.S.: Efficient discovery of frequent approximate sequential patterns. In: Proceedings of the 7th IEEE International Conference on Data Mining, pp. 751–756 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul, 120-749, Republic of Korea

    Da-Jung Cho, Yo-Sub Han & Hwee Kim

Authors
  1. Da-Jung Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yo-Sub Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hwee Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yo-Sub Han .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Cho, DJ., Han, YS., Kim, H. (2015). Frequent Pattern Mining with Non-overlapping Inversions. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation