journal article·2023-09-29Open access

Detection of Unknown Polymorphic Patterns Using Feature-Extracting Part of a Convolutional Autoencoder

Przemysław Kucharski, Krzysztof Ślot

Applied Sciences· Volume 13· Issue 19

Abstract

Background: The present paper proposes a novel approach for detecting the presence of unknown polymorphic patterns in random symbol sequences that also comprise already known polymorphic patterns. Methods: We propose to represent rules that define the considered patterns as regular expressions and show how these expressions can be modeled using filter cascades of neural convolutional layers. We adopted a convolutional autoencoder (CAE) as a pattern detection framework. To detect unknown patterns, we first incorporated knowledge of known rules into the CAE’s convolutional feature extractor by fixing weights in some of its filter cascades. Then, we executed the learning procedure, where the weights of the remaining filters were driven by two different objectives. The first was to ensure correct sequence reconstruction, whereas the second was to prevent weights from learning the already known patterns. Results: The proposed methodology was tested on sample sequences derived from the human genome. The analysis of the experimental results provided statistically significant information on the presence or absence of polymorphic patterns that were not known in advance. Conclusions: The proposed method was able to detect the existence of unknown polymorphic patterns.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Neural Networks and Applications · Evolutionary Algorithms and Applications · Fuzzy Logic and Control Systems

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Institute of Applied Computer Science, Lodz University of Technology, Stefanowskiego 18, 90-537 Lodz, Poland

References (27)

Show source-provided references
1. He, Y., Shen, Z., Zhang, Q., Wang, S., and Huang, D.S. (2020). A Survey on Deep Learning in DNA/RNA Motif Mining. Brief. Bioinform., 22.10.1093/bib/bbaa229 ↗
2. Training Interpretable Convolutional Neural Networks by Differentiating Class-Specific Filters
3. Representation learning of genomic sequence motifs with convolutional neural networks10.1371/journal.pcbi.1007560 ↗
4. Weight asynchronous update: Improving the diversity of filters in a deep convolutional network10.1007/s41095-020-0185-5 ↗
5. Knowledge-Based Artificial Neural Networks10.1016/0004-3702(94)90105-8 ↗
6. Weight Agnostic Neural Networks
7. Marra, G., Diligenti, M., Giannini, F., Gori, M., and Maggini, M. (2020). Relational Neural Machines. arXiv.
8. Protein sequence design with deep generative models10.1016/j.cbpa.2021.04.004 ↗
9. Generative models for graph-based protein design
10. Sabban, S., and Markovsky, M. (2020). RamaNet: Computational de novo helical protein backbone design using a long short-term memory generative neural network. F1000Research, 9.10.12688/f1000research.22907.3 ↗
11. Bepler, T., and Berger, B. (2019). Learning protein sequence embeddings using information from structure. arXiv.
12. Leveraging Uncertainty in Machine Learning Accelerates Biological Discovery and Design10.1016/j.cels.2020.09.007 ↗
13. Ding, Y., Li, J.Y., Wang, M., Tu, X., and Gao, G. (2017). An exact transformation for CNN kernel enables accurate sequence motif identification and leads to a potentially full probabilistic interpretation of CNN. bioRxiv.10.1101/163220 ↗
14. DREME: Motif discovery in transcription factor ChIP-seq data10.1093/bioinformatics/btr261 ↗
15. Bailey, T.L., and Elkan, C. (1994). Fitting a Mixture Model by Expectation Maximization to Discover Motifs in Bipolymers, University of California.
16. Hashim, F.A., Mabrouk, M.S., and Al-Atabany, W. (2019). Review of different sequence motif finding algorithms. Avicenna J. Med. Biotechnol., 11.
17. Sun, H.Q., Low, M.Y.H., Hsu, W.J., and Rajapakse, J.C. (2010, January 15–16). ListMotif: A time and memory efficient algorithm for weak motif discovery. Proceedings of the 2010 IEEE International Conference On Intelligent Systems and Knowledge Engineering, Hangzhou, China.
18. YMF: A program for discovery of novel transcription factor binding sites by statistical overrepresentation10.1093/nar/gkg618 ↗
19. EXTREME: An online EM algorithm for motif discovery10.1093/bioinformatics/btu093 ↗
20. Reid, J.E., and Wernisch, L. (2011). STEME: Efficient EM to find motifs in large data sets. Nucleic Acids Res., 39.10.1093/nar/gkr574 ↗
21. Bouamama, S., Boukerram, A., and Al-Badarneh, A.F. (2010, January 8–10). Motif finding using ant colony optimization. Proceedings of the Swarm Intelligence: 7th International Conference, ANTS 2010, Brussels, Belgium.10.1007/978-3-642-15461-4_45 ↗
22. Computer methods to locate signals in nucleic acid sequences10.1093/nar/12.1Part2.505 ↗
23. Binary codes capable of correcting deletions, insertions, and reversals
24. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., and Antiga, L. (2019). Advances in Neural Information Processing Systems 32, Curran Associates, Inc.
25. Levene, H. (1960). Essays in Honor of Harold Hotelling, Springer.
26. Distribution-Free Two-Sample Tests for Scale10.1080/01621459.1976.10481517 ↗
27. A comparison of tests of equality of variances10.1016/0167-9473(95)00054-2 ↗