Control of automated behaviour: Insights from the Discrete Sequence Production task
Work with the discrete sequence production (DSP) task has provided a substantial literature on discrete sequencing skill over the last decades. The purpose of the current article is to provide a comprehensive overview of this literature and of the ...
Elger eAbrahamse +3 more
doaj +2 more sources
S$^\text{3}$Attention: Improving Long Sequence Attention With Smoothed Skeleton Sketching
Attention based models have achieved many remarkable breakthroughs in numerous applications. However, the quadratic complexity of Attention makes the vanilla Attention based models hard to apply to long sequence tasks. Various improved Attention structures are proposed to reduce the computation cost by inducing low rankness and approximating the whole ...
Xue Wang +8 more
openaire +3 more sources
k-nonical space: sketching with reverse complements. [PDF]
Sequences equivalent to their reverse complements (i.e., double-stranded DNA) have no analogue in text analysis and non-biological string algorithms.
Marçais G, Elder CS, Kingsford C.
europepmc +2 more sources
Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2. [PDF]
A genomic sketch is a small, probabilistic representation of the set of k-mers in a sequencing data set. Sketches are building blocks for large-scale analyses that consider similarities between many pairs of sequences or sequence collections.
Baker DN, Langmead B.
europepmc +2 more sources
AniFaceDrawing: Anime Portrait Exploration during Your Sketching [PDF]
This paper focuses on how artificial intelligence (AI) can be used to assist general users in the creation of professional portraits, that is, consistently converting rough sketches into high-quality anime portraits during their sketching process.
Zhengyu Huang +3 more
semanticscholar +1 more source
Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets. [PDF]
Most sequence sketching methods work by selecting specific k-mers from sequences so that the similarity between two sequences can be estimated using only the sketches.
Marçais G, DeBlasio D, Kingsford C.
europepmc +2 more sources
Krylov Subspace Recycling With Randomized Sketching For Matrix Functions [PDF]
A Krylov subspace recycling method for the efficient evaluation of a sequence of matrix functions acting on a set of vectors is developed. The method improves over the recycling methods presented in [Burke et al., arXiv:2209.14163, 2022] in that it uses ...
Liam P Burke, S. Güttel
semanticscholar +1 more source
Generative modeling via tensor train sketching [PDF]
In this paper, we introduce a sketching algorithm for constructing a tensor train representation of a probability density from its samples. Our method deviates from the standard recursive SVD-based procedure for constructing a tensor train.
Y. Hur +4 more
semanticscholar +1 more source
Dashing 2: genomic sketching with multiplicities and locality-sensitive hashing
A genomic sketch is a small, probabilistic representation of the set of k-mers in a sequencing dataset. Sketches are building blocks for large-scale analyses that consider similarities between many pairs of sequences or sequence collections.
Daniel N. Baker, Ben Langmead
semanticscholar +1 more source
Mining Discriminative K-Mers in DNA Sequences Using Sketches and Hardware Acceleration [PDF]
Extracting discriminative k-mers is an important and challenging problem in DNA sequence analysis with applications in metagenomics and motif discovery. Despite the availability of multiple computational tools designed for this purpose, most discriminative k-mer discovery methods suffer from long execution times and high memory usage when processing ...
Antonio Saavedra +4 more
openaire +2 more sources

