Results 41 to 50 of about 735,070 (175)
BMC Bioinformatics, 2023 Background A large number of researchers have devoted to accelerating the speed of genome sequencing and reducing the cost of genome sequencing for decades, and they have made great strides in both areas, making it easier for researchers to study and ...
Zhiwen Lu +3 more
doaj +1 more source
Counting Suffix Arrays and Strings
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schürmann, Klaus-Bernd, Stoye, Jens
openaire +3 more sources
An optimized FM-index library for nucleotide and amino acid search
Algorithms for Molecular Biology, 2021 Background Pattern matching is a key step in a variety of biological sequence analysis pipelines. The FM-index is a compressed data structure for pattern matching, with search run time that is independent of the length of the database text ...
Tim Anderson, Travis J. Wheeler
doaj +1 more source
SLDMS: A Tool for Calculating the Overlapping Regions of Sequences
Frontiers in Plant Science, 2022 In the field of genome assembly, contig assembly is one of the most important parts. Contig assembly requires the processing of overlapping regions of a large number of DNA sequences and this calculation usually takes a lot of time.
Yu Chen +4 more
doaj +1 more source
Accelerated preprocessing in task of searching substrings in a string
Advanced Engineering Research, 2019 Introduction. A rapid development of the systems such as Yandex, Google, etc., has predetermined the relevance of the task of searching substrings in a string, and approaches to its solution are actively investigated. This task is used to create database
A. V. Mazurenko, N. V. Boldyrikhin
doaj +1 more source
Efficient privacy-preserving variable-length substring match for genome sequence
Algorithms for Molecular Biology, 2022 The development of a privacy-preserving technology is important for accelerating genome data sharing. This study proposes an algorithm that securely searches a variable-length substring match between a query and a database sequence. Our concept hinges on
Yoshiki Nakagawa +2 more
doaj +1 more source
TOPAZ: asymmetric suffix array neighbourhood search for massive protein databases
BMC Bioinformatics, 2018 Background Protein homology search is an important, yet time-consuming, step in everything from protein annotation to metagenomics. Its application, however, has become increasingly challenging, due to the exponential growth of protein databases.
Alan Medlar, Liisa Holm
doaj +1 more source
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
KVLMM: A Trajectory Prediction Method Based on a Variable-Order Markov Model With Kernel Smoothing
IEEE Access, 2018 With the dramatic proliferation of global positioning system (GPS) devices, a rich range of research has been conducted on the analysis of GPS trajectories.
Xing Wang +3 more
doaj +1 more source
RAPSearch: a fast protein similarity search tool for short reads
BMC Bioinformatics, 2011 Background Next Generation Sequencing (NGS) is producing enormous corpuses of short DNA reads, affecting emerging fields like metagenomics. Protein similarity search--a key step to achieve annotation of protein-coding genes in these short reads, and ...
Choi Jeong-Hyeon, Ye Yuzhen, Tang Haixu
doaj +1 more source