GenRepAI: Utilizing Artificial Intelligence to Identify Repeats in Genomic Suffix Trees
F Kaniwa - Current Bioinformatics, 2024 - benthamdirect.com
Background The human genome is densely populated with repetitive DNA sequences that
play crucial roles in genomic functions and structures but are also implicated in over 40 …
play crucial roles in genomic functions and structures but are also implicated in over 40 …
A Practical Algorithm for DNA Pattern Searching using Database-Based Approach
F Kaniwa, M Phuthego - 2018 IEEE International Conference …, 2018 - ieeexplore.ieee.org
Relational database management systems keep expanding their range of analytical
functionalities. On the other hand, DNA sequence information keep multiplying making it …
functionalities. On the other hand, DNA sequence information keep multiplying making it …
Parallel algorithm for indexing large DNA sequences using MapReduce on Hadoop
F Kaniwa, O Dinakenyane… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
MapReduce has recently become very successful parallel processing technique. Latest
DNA sequencing technologies are now able to generate huge DNA sequences easily and …
DNA sequencing technologies are now able to generate huge DNA sequences easily and …
[PDF][PDF] Komprese biologických sekvencí pomocí sufixových stromů nebo polí
BL Zukalová - is.muni.cz
Cílem práce bylo vytvořit nástroj pro kompresi biologických sekvencí. Tento nástroj jsem
naimplementovala v jazyce C++ a pojmenovala jsem ho Sequence Data File System …
naimplementovala v jazyce C++ a pojmenovala jsem ho Sequence Data File System …
[PDF][PDF] Past-future Mutual Information Estimation in Sparse Information Conditions.
We introduce the CT-PFMI, a context tree based algorithm that estimates the past-future
mutual information (PFMI) between different time series. By applying a pruning phase of the …
mutual information (PFMI) between different time series. By applying a pruning phase of the …