PhaTYP: predicting the lifestyle for bacteriophages using BERT

Abstract

Bacteriophages (or phages), which infect bacteria, have two distinct lifestyles: virulent and temperate. Predicting the lifestyle of phages helps decipher their interactions with their bacterial hosts, aiding phages’ applications in fields such as phage therapy. Because experimental methods for annotating the lifestyle of phages cannot keep pace with the fast accumulation of sequenced phages, computational method for predicting phages’ lifestyles has become an attractive alternative. Despite some promising results, computational lifestyle prediction remains difficult because of the limited known annotations and the sheer amount of sequenced phage contigs assembled from metagenomic data. In particular, most of the existing tools cannot precisely predict phages’ lifestyles for short contigs. In this work, we develop PhaTYP (Phage TYPe prediction tool) to improve the accuracy of lifestyle prediction on short contigs. We design two different training tasks, self-supervised and fine-tuning tasks, to overcome lifestyle prediction difficulties. We rigorously tested and compared PhaTYP with four state-of-the-art methods: DeePhage, PHACTS, PhagePred and BACPHLIP. The experimental results show that PhaTYP outperforms all these methods and achieves more stable performance on short contigs. In addition, we demonstrated the utility of PhaTYP for analyzing the phage lifestyle on human neonates’ gut data. This application shows that PhaTYP is a useful means for studying phages in metagenomic data and helps extend our understanding of microbial communities.

References 66

1. 1.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

2. 2.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

3. 3.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

4. 4.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

5. 5.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

6. 6.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

7. 7.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

8. 8.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

9. 9.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

10. 10.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

11. 11.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

12. 12.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

13. 13.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

14. 14.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

15. 15.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

16. 16.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

17. 17.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

18. 18.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

19. 19.
    Accelerated Profile HMM Searches · 2011

    No notice
20. 20.
    BLAST+: architecture and applications · 2009

    No notice
21. 21.
    Prodigal: prokaryotic gene recognition and translation initiation site identification · 2010

    No notice
22. 22.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

23. 23.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

24. 24.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

25. 25.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

26. 26.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

27. 27.
    Computational approaches to predict bacteriophage–host relationships · 2015

    No notice
28. 28.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

29. 29.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

30. 30.
    Environmental Viral Genomes Shed New Light on Virus-Host Interactions in the Ocean · 2017

    No notice
31. 31.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

32. 32.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

33. 33.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

34. 34.
    VirFinder: a novel k-mer based tool for identifying viral sequences from assembled metagenomic data · 2017

    No notice
35. 35.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

36. 36.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

37. 37.
    ΦCrAss001 represents the most abundant bacteriophage family in the human gut and infects Bacteroides intestinalis · 2018

    No notice
38. 38.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

39. 39.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

40. 40.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

41. 41.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

42. 42.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

43. 43.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

44. 44.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

45. 45.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

46. 46.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

47. 47.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

48. 48.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

49. 49.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

50. 50.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

51. 51.
    Bacteriophage classification for assembled contigs using graph convolutional network · 2021

    No notice
52. 52.
    Massive expansion of human gut bacteriophage diversity · 2021

    No notice
53. 53.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

54. 54.
    BACPHLIP: predicting bacteriophage lifestyle from conserved protein domains · 2021

    No notice
55. 55.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

56. 56.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

57. 57.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

58. 58.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

59. 59.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

60. 60.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

61. 61.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

62. 62.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

63. 63.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

64. 64.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

65. 65.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

66. 66.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

Reads

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.