Results 111 to 120 of about 14,384 (164)

PERC: a suite of software tools for the curation of cryoEM data with application to simulation, modeling and machine learning. [PDF]

Acta Crystallogr F Struct Biol Commun
Costa-Gomes B, Greer J, Juraschko N, Parkhurst J, Mirecka J, Famili M, Rangel-Smith C, Strickson O, Lowe A, Basham M, Burnley T.   +10 more
europepmc   +1 more source

Suffix sorting via matching statistics. [PDF]

Algorithms Mol Biol
Lipták Z, Masillo F, Puglisi SJ.
europepmc   +1 more source

Fully memristive spiking neural network for energy-efficient graph learning. [PDF]

Sci Adv
Shi T, Gao L, Zhou R, Tian Y, Chen P, Ding Y, Tang S, Ma H, Lu J, Zhang H, Wang Z, Lyu B, Zhang X, Yan X, Liu Q.   +14 more
europepmc   +1 more source

Fast detection of unique genomic regions. [PDF]

Comput Struct Biotechnol J
Vieira Mourato B, Haubold B.
europepmc   +1 more source

Columba: fast approximate pattern matching with optimized search schemes. [PDF]

Bioinformatics
Renders L, Depuydt L, Gagie T, Fostier J.   +3 more
europepmc   +1 more source

Run-length compressed metagenomic read classification with SMEM-finding and tagging. [PDF]

iScience
Depuydt L, Ahmed OY, Fostier J, Langmead B, Gagie T.   +4 more
europepmc   +1 more source

How to Find Long Maximal Exact Matches and Ignore Short Ones. [PDF]

Dev Lang Theory
Gagie T.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Computing Quasi Suffix Arrays

2003
We introduce quasi suffix arrays as a generalization of suffix arrays for character strings. We show that a quasi suffix array encodes enough of the structure of the string to be a useful construct for many applications where the full power of suffix arrays is not necessary, notably in problems that do not require lexicographical order, for example ...
Franěk, František, Holub, Jan, Smyth, William F., Xiao, Xiangdong   +3 more
openaire   +2 more sources