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

Two Strikes Against the Phage Recombination Problem

  • Conference paper
  • First Online:
Comparative Genomics (RECOMB-CG 2023)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 13883))

Included in the following conference series:

  • 270 Accesses

Abstract

The recombination problem is inspired by genome rearrangement events that occur in bacteriophage populations. Its goal is to explain the transformation of one bacteriophage population into another using the minimum number of recombinations. Here we show that the combinatorial problem is NP-Complete, both when the target population contains only one genome of unbounded length, and when the size of the genomes is bounded by a constant. In the first case, the existence of a minimum solution is shown to be equivalent to a 3D-matching problem, and in the second case, to a satisfiability problem. These results imply that the comparison of bacteriophage populations using recombinations may have to rely on heuristics that exploit biological constraints.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Abbott, S., Fairbanks, D.J.: Experiments on Plant Hybrids by Gregor Mendel. Genetics 204(2), 407–422 (10 2016). https://doi.org/10.1534/genetics.116.195198

  2. Bergeron, A., Meurs, M.J., Valiquette-Labonté, R., Swenson, K.M.: On the comparison of bacteriophage populations. In: Jin, L., Durand, D. (eds.) Comparative Genomics, pp. 3–20. Springer International Publishing, Cham (2022)

    Chapter  Google Scholar 

  3. Berman, P., Karpinski, M., Scott, A.: Approximation hardness of short symmetric instances of max-3sat. In: Electronic Colloquium on Computational Complexity (ECCC). vol. TR03-049 (2004)

    Google Scholar 

  4. Botstein, D.: A theory of modular evolution for bacteriophages. Ann. N. Y. Acad. Sci. 354(1), 484–491 (1980). https://doi.org/10.1111/j.1749-6632.1980.tb27987.x

    Article  Google Scholar 

  5. Changat, M., et al.: Transit sets of-point crossover operators. AKCE Int. J. Graphs Comb. 17(1), 519–533 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chevallereau, A., Pons, B.J., van Houte, S., Westra, E.R.: Interactions between bacterial and phage communities in natural environments. Nat. Rev. Microbiol. 20(1), 49–62 (2022)

    Article  Google Scholar 

  7. Chmielewska-Jeznach, M., Bardowski, J.K., Szczepankowska, A.K.: Molecular, physiological and phylogenetic traits of lactococcus 936-type phages from distinct dairy environments. Sci. Rep. 8(1), 12540 (2018). https://doi.org/10.1038/s41598-018-30371-3

    Article  Google Scholar 

  8. Gitchoff, P., Wagner, G.P.: Recombination induced hypergraphs: a new approach to mutation-recombination isomorphism. Complexity 2(1), 37–43 (1996)

    Article  MathSciNet  Google Scholar 

  9. Kahánková, J., Pantuček, R., Goerke, C., Ružičková, V., Holochová, P., Doškar, J.: Multilocus pcr typing strategy for differentiation of Staphylococcus aureus siphoviruses reflecting their modular genome structure. Environ. Microbiol. 12(9), 2527–2538 (2010)

    Article  Google Scholar 

  10. Karp, R.: Reducibility among combinatorial problems. Complexity of Computer Computations, pp. 85–103 (1972)

    Google Scholar 

  11. Kupczok, A., Neve, H., Huang, K.D., Hoeppner, Marc P Heller, K.J., Franz, C.M.A.P., Dagan, T.: Rates of Mutation and Recombination in Siphoviridae Phage Genome Evolution over Three Decades. Mol. Biol. Evol. 35(5), 1147–1159 (02 2018). https://doi.org/10.1093/molbev/msy027

  12. Lavelle, K., et al.: A decade of streptococcus thermophilus phage evolution in an irish dairy plant. Appl. Environ. Microbiol. 84(10) (2018). https://doi.org/10.1128/AEM.02855-17

  13. Murphy, J., et al.: Comparative genomics and functional analysis of the 936 group of lactococcal siphoviridae phages. Scientific Reports 6, 21345 EP - (02 2016)

    Google Scholar 

  14. Swenson, K.M., Guertin, P., Deschênes, H., Bergeron, A.: Reconstructing the modular recombination history of staphylococcus aureus phages. In: BMC bioinformatics. vol. 14, p. S17. Springer (2013). https://doi.org/10.1186/1471-2105-14-S15-S17

Download references

Acknowledgments

ML was partially supported by Canada NSERC Grant number 2019-05817. AB was partially supported by Canada NSERC Grant number 05729–2014. KMS was partially supported by the grant ANR-20-CE48-0001 from the French National Research Agency (ANR).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manuel Lafond .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lafond, M., Bergeron, A., Swenson, K.M. (2023). Two Strikes Against the Phage Recombination Problem. In: Jahn, K., Vinař, T. (eds) Comparative Genomics. RECOMB-CG 2023. Lecture Notes in Computer Science(), vol 13883. Springer, Cham. https://doi.org/10.1007/978-3-031-36911-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-36911-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-36910-0

  • Online ISBN: 978-3-031-36911-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics