Nov 20, 2022 · We propose a novel fast top-k similarity search algorithm for DNA databases. We conducted experiments using real-world DNA sequence datasets.
Nov 28, 2022 · We propose a novel fast top-k similarity search algorithm for DNA databases. We conducted experiments using real-world DNA sequence datasets.
Top-k similar sequence search is an essential tool for DNA data management. Given a DNA database, it is a problem to extract k similar DNA sequence pairs in ...
People also ask
Which database is used to compare and store DNA sequences?
What is the name of the database used to identify DNA sequences?
What is the largest DNA database?
What are the different types of DNA databases?
A method for fast database search for all k-nucleotide repeats - PMC
pmc.ncbi.nlm.nih.gov › PMC308537
In this paper, we present some new techniques that are useful in recognizing repeating patterns and describe a new program for rapidly detecting repeat regions ...
Jul 16, 2024 · GSearch can search 8000 query genomes against all available microbial or viral genomes for their best matches (n = ∼318 000 or ∼3 000 000, respectively) ...
Sep 5, 2021 · The k-mer method is commonly used in DNA sequence preprocessing. It extracts a small section of length k starting from each base of the original ...
It breaks the database sequence into k-mer words and hashes their location to speed up future searches. It then matches possible k-mers in the query sequence ...
Aug 6, 2021 · Here we demonstrate a technique for executing similarity search over a DNA-based database of 1.6 million images.
The original BLAST algorithm performs three basic steps to align similar sequences. These three steps are illustrated in the format of DNA sequences in Figure 2 ...
We describe an algorithm, SSAHA (SequenceSearch and Alignment by HashingAlgorithm), for performing fast searches on databases containing multiple gigabases ...