Skip to main content
SpringerLink
Log in

Computing the Minimum λ-Cover in Weighted Sequences

  • Conference paper
Intelligent Computing Technology (ICIC 2012)

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

Included in the following conference series:

  • 2558 Accesses

Abstract

Given a weighted sequence X of length n and an integer constant λ, the minimum λ-cover problem of weighted sequences is to find the sets of λ factors of X each of equal length such that the set covers X, and the length of each element in the set is minimum. By constructing the Equivalence Class Tree and iteratively computing the occurrences of a set of factors in weighted sequences, we tackle the problem in O(n 2) time for constant alphabet size.

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. Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal Superprimitivity Testing for Strings. Information Processing Letters 39, 17–20 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Breslauer, D.: An On-line String Superprimitivity Test. Information Processing Letters 44, 345–347 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cole, R., Iliopoulos, C.S., Mohamed, M., Smith, W.F., Yang, L.: Computing the Minimum k-cover of a String. In: Proc. of the 2003 Prague Stringology Conference (PSC 2003), pp. 51–64 (2003)

    Google Scholar 

  4. Christodoulakis, M., Iliopoulos, C.S., Mouchard, L., Perdikuri, K., Tsakalidis, A., Tsichlas, K.: Computation of Repetitions and Regularities on Biological Weighted Sequences. Journal of Computational Biology 13(6), 1214–1231 (2006)

    Article  MathSciNet  Google Scholar 

  5. Crochemore, M.: An Optimal Algorithm for Computing the Repetitions in a Word. Information Processing Letters 12(5), 244–250 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)

    Google Scholar 

  7. Guo, Q., Zhang, H., Iliopoulos, C.S.: Computing the λ-covers of a String. Information Sciences 177, 3957–3967 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Iliopoulos, C.S., Moore, D.W.G., Park, K.: Covering a String. Algorithmica 16, 288–297 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. Iliopoulos, C.S., Mohamed, M., Smyth, W.F.: New Complexity Results for the k-covers Problem. Information Sciences 181, 251–255 (2011)

    Article  MathSciNet  Google Scholar 

  10. Iliopoulos, C.S., Smith, W.F.: An On-line Algorithm of Computing a Minimum Set of k-covers of a String. In: Proc. of the Ninth Australian Workshop on Combinatorial Algorithms (AWOCA), pp. 97–106 (1998)

    Google Scholar 

  11. Li, Y., Smyth, W.F.: Computing the Cover Array in Linear Time. Algorithmica 32(1), 95–106 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Zhang, H., Guo, Q., Iliopoulos, C.S.: Varieties of Regularities in Weighted Sequences. In: Chen, B. (ed.) AAIM 2010. LNCS, vol. 6124, pp. 271–280. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Zhang, H., Guo, Q., Iliopoulos, C.S.: Loose and Strict Repeats in Weighted Sequences. Protein and Peptide Letters 17(9), 1136–1142 (2010)

    Article  Google Scholar 

  14. The Human Genome Project (HGP), http://www.nbgri.nih.gov/HGP/

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, 310023, China

    Hui Zhang

  2. College of Computer Science, Zhejiang University, Hangzhou, 310027, China

    Qing Guo

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

    Costas S. Iliopoulos

Authors
  1. Hui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qing Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Costas S. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electronics and Information Engineering, Machine Learning and Systems Biology Laboratory, Tongji University, 4800 Caoan Road, 201804, Shanghai, China

    De-Shuang Huang

  2. School of Electronics and Information Engineering, Tongji University, 4800 Caoan Road, 201804, Shanghai, China

    Changjun Jiang

  3. Electrical and Electronics Department, Polytechnic of Bari, Via Orabona, 4, 70125, Bari, Italy

    Vitoantonio Bevilacqua

  4. Faculty of Engineering, District University Francisco José de Caldas, Cra. 7a No. 40-53, Fifth Floor, Bogotá, Colombia

    Juan Carlos Figueroa

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Guo, Q., Iliopoulos, C.S. (2012). Computing the Minimum λ-Cover in Weighted Sequences. In: Huang, DS., Jiang, C., Bevilacqua, V., Figueroa, J.C. (eds) Intelligent Computing Technology. ICIC 2012. Lecture Notes in Computer Science, vol 7389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31588-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31588-6_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31587-9

  • Online ISBN: 978-3-642-31588-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation