Results 151 to 160 of about 4,379 (204)

Building a pangenome alignment index via recursive prefix-free parsing. [PDF]

iScience
Ferro E, Oliva M, Gagie T, Boucher C.
europepmc   +1 more source

Efficient Construction and Utilization of k-Ordered FM-indexes with kISS for Ultra-Fast Read Mapping in Large Genomes. [PDF]

Bioinformatics
Yang ZD, Kuo HY, Hsieh PW, Hung JH.
europepmc   +1 more source

FroM Superstring to Indexing: a space-efficient index for unconstrained <i>k</i>-mer sets using the Masked Burrows-Wheeler Transform (MBWT). [PDF]

Bioinform Adv
Sladký O, Veselý P, Břinda K.
europepmc   +1 more source

BWT construction and search at the terabase scale. [PDF]

Bioinformatics
Li H.
europepmc   +1 more source

ORMIR-MIDS: an open standard for curating and sharing musculoskeletal imaging data. [PDF]

JBMR Plus
Santini F, Monzon M, Poncioni S, Bonaretti S, Hirvasniemi J, Froeling M, Cameron D.   +6 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

Efficiency of Learned Indexes on Genome Spectra. [PDF]

Lebniz Int Proc Inform
Abrar MH, Medvedev P, Vinciguerra G.
europepmc   +1 more source

An Efficient Dynamic Data Structure for Haplotype Matching and Compression on Biobank-Scale Data. [PDF]

J Comput Biol
Shakya P, Sanaullah A, Zhi D, Zhang S.
europepmc   +1 more source

A dataset of spatially resolved transcriptomics of post-natal cardiac development in mice. [PDF]

Sci Data
Zheng Y, Sun T, Pu Z, Li L, Wu X, Yang Y, Lei M, Tan X, Li T, Ou X, Chen T.   +10 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Sampled suffix array with minimizers

Software - Practice and Experience, 2017
SummarySampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claudeet al.showed an alphabet sampling scheme allowing for more efficient pattern searches compared with the sparse suffix array, for long enough patterns.
Marcin Raniszewski, Szymon Grabowski
exaly   +2 more sources