Results 31 to 40 of about 37,210 (201)
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
What does visual suffix interference tell us about spatial location in working memory? [PDF]
, 2015 A visual object can be conceived of as comprising a number of features bound together by their joint spatial location. We investigate the question of whether the spatial location is automatically bound to the features or whether the two are separable ...
Allen, RJ +4 more
core +1 more source
Dynamic extended suffix arrays
Journal of Discrete Algorithms, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Salson, Mikael +3 more
openaire +5 more sources
Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX - NAACL '07, 2007 Suppose we have a large dictionary of strings. Each entry starts with a figure of merit (popularity). We wish to find the k-best matches for a substring, s, in a dictinoary, dict. That is, grep s dict | sort -n | head -k, but we would like to do this in sublinear time.
Kenneth Ward Church +2 more
openaire +2 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
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet [PDF]
, 2017 The suffix array augmented with the LCP array is perhaps the most important data structure in modern string processing. There has been a lot of recent research activity on constructing these arrays in external memory.
, Kempa, Dominik
core +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
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