A5005602830- Genomics and Phylogenetic Studies
- Quantum Computing Algorithms and Architecture
- RNA and protein synthesis mechanisms
- Genetics, Bioinformatics, and Biomedical Research
- Explainable Artificial Intelligence (XAI)
- Visual Attention and Saliency Detection
- Vehicle Routing Optimization Methods
- Quantum Information and Cryptography
- Fractal and DNA sequence analysis
- Evolutionary Algorithms and Applications
- Remote Sensing and LiDAR Applications
- Graph Theory and Algorithms
- DNA and Biological Computing
- Quantum-Dot Cellular Automata
- Optimization and Packing Problems
- Algorithms and Data Compression
- Chromosomal and Genetic Variations
- Quantum Mechanics and Applications
Warsaw University of Technology
2013-2025
Institute of Computer Science
2022-2024
Abstract Background The assembly task is an indispensable step in sequencing genomes of new organisms and studying structural genomic changes. In recent years, the dynamic development next-generation (NGS) methods raises hopes for making whole-genome a fast reliable tool used, example, medical diagnostics. However, this hampered by slowness computational requirements current processing algorithms, which need to develop more efficient algorithms. One possible approach, still little explored,...
Deep neural networks (DNNs) have achieved outstanding results in domains such as image processing, computer vision, natural language processing and bioinformatics. In recent years, many methods been proposed that can provide a visual explanation of decision made by classifiers. Saliency maps are probably the most popular. However, it is still unclear how to properly interpret saliency for given which techniques perform accurately. This paper presents methodology practically evaluate real...
This article reviews chosen topics related to the development of Information Quantum Technologies in major areas measurements, communications, and computing.These fields start build their ecosystems which future will probably coalesce into a homogeneous quantum information layer consisting such interconnected components as internet, full size computers with efficient error corrections ultrasensitive metrology nodes stationary mobile.Today, however, skepticism expressing many doubts about...
The aim of this article is to discuss the issue comparing nucleotide sequences in order detect chromosomal rearrangements (for example, study genomes two cucumber varieties, Polish and Chinese). Two basic algorithms for detecting has been described: Smith-Waterman algorithm, as well a new method searching genetic markers combination with Knuth-Morris-Pratt algorithm. computer program client-server architecture was developed. properties were examined on Escherichia coli Arabidopsis thaliana...
Whole genome sequencing enables to use the longest common subsequence algorithm detect genetic structure variations. We propose search position of short unique fragments, markers, achieve acceptable time and space complexity. The markers are generated by algorithms searching sequence or its Fourier transformation. presented methods checked on structural variations in silico bacterial genomes giving comparable better results than other solutions.