Results 141 to 150 of about 4,504,185 (191)
Some of the next articles are maybe not open access.

Simpler FM-index for parameterized string matching

Information Processing Letters, 2021
In parameterized string matching, a string comprises static and parameterized symbols. Two strings are said to be matched if there exists a one-to-one mapping of parameterized symbols onto itself such that it transforms one string into the other ...
Sung-Hwan Kim, Hwan-Gue Cho
semanticscholar   +2 more sources

Memory–Efficient FM-Index Construction for Reference Genomes

2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 2022
FM-index is traditionally constructed over the forward strand complemented with the reverse strand to support searching both strands by executing a single procedure. Although it expedite the process of indexing, it consumes large amount of memory.
A. K. Das   +2 more
semanticscholar   +2 more sources

FM-index for Dummies

open access: yesInternational Conference -Beyond Databases, Architectures, and Structures, 2015
The FM-index is a celebrated compressed data structure for full-text pattern searching. After the first wave of interest in its theoretical developments, we can observe a surge of interest in practical FM-index variants in the last few years.
S. Grabowski   +2 more
semanticscholar   +3 more sources

Accelerating FM-index Search for Genomic Data Processing

Proceedings of the 47th International Conference on Parallel Processing, 2018
The deluge of genomics data is incurring prohibitively high computational costs. As an important building block for genomic data processing algorithms, FM-index search occupies most of execution time in sequence alignment. Due to massive random streaming
Yuanrong Wang   +4 more
semanticscholar   +2 more sources

Simple Runs-Bounded FM-Index Designs Are Fast

open access: yesThe Sea, 2023
Peer ...
Diego Díaz-Domínguez   +3 more
semanticscholar   +5 more sources

FM-Index Reveals the Reverse Suffix Array

open access: yesAnnual Symposium on Combinatorial Pattern Matching, 2020
Given a text T[1,n] over an alphabet Σ of size σ, the suffix array of T stores the lexicographic order of the suffixes of T. The suffix array needs Θ(nlog n) bits of space compared to the n log σ bits needed to store T itself. A major breakthrough [FM - Index, FOCS'00] in the last two decades has been encoding the suffix array in near-optimal number of
Arnab Ganguly   +6 more
semanticscholar   +4 more sources

A novel fast multiple nucleotide sequence alignment method based on FM-index

open access: yesBriefings in Bioinformatics, 2021
AbstractMultiple sequence alignment (MSA) is fundamental to many biological applications. But most classical MSA algorithms are difficult to handle large-scale multiple sequences, especially long sequences. Therefore, some recent aligners adopt an efficient divide-and-conquer strategy to divide long sequences into several short sub-sequences. Selecting
Huan Liu, Q. Zou, Yun Xu
semanticscholar   +3 more sources

A Data-Aware FM-index [PDF]

open access: yesWorkshop on Algorithm Engineering and Experimentation, 2015
Hongwei Huo   +5 more
semanticscholar   +2 more sources

An FM-Index Based High-Throughput Memory-Efficient FPGA Accelerator for Paired-End Short-Read Mapping

IEEE Transactions on Biomedical Circuits and Systems, 2023
This article presents an Ferragina-Manzini index (FM-index) based paired-end short-read mapping hardware accelerator. Four techniques are proposed to significantly reduce the number of memory accesses and operations to improve the throughput.
Chung-Hsuan Yang   +5 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy