Results 121 to 130 of about 37,020 (188)

Computing Suffix Links for Suffix Trees and Arrays

open access: yes, 2005
We present a new and simple algorithm to reconstruct suffix links in suffix trees and suffix arrays. The algorithm is based on observations regarding suffix tree construction algorithms. With our algorithm we bring suffix arrays even closer to the ease of use and implementation of suffix trees.
openaire   +1 more source

Generating multiple alignments on a pangenomic scale. [PDF]

open access: yesBioinformatics
Olbrich J, Büchler T, Ohlebusch E.
europepmc   +1 more source

MRS-BIDS, an extension to the Brain Imaging Data Structure for magnetic resonance spectroscopy. [PDF]

open access: yesSci Data
Bouchard AE   +13 more
europepmc   +1 more source

Fast and accurate short-read alignment with hybrid hash-tree data structure. [PDF]

open access: yesGenomics Inform
Makino J   +3 more
europepmc   +1 more source

GIN-TONIC: non-hierarchical full-text indexing for graph genomes. [PDF]

open access: yesNAR Genom Bioinform
Öztürk Ü, Mattavelli M, Ribeca P.
europepmc   +1 more source

Secure Compressed Suffix Arrays

open access: yes
This paper proposes a secure compressed suffix array, which is a data oblivious and compressed version of the suffix array used for finding substrings of a large string. Secure compressed suffix arrays can be used for indexing a large collection of strings containing personal information such as DNA data.
openaire   +1 more source

Fast sequence alignment for centromeres with RaMA. [PDF]

open access: yesGenome Res
Zhang P, Wei Y, Tian Q, Zou Q, Wang Y.
europepmc   +1 more source

Home - About - Disclaimer - Privacy