Compressed full-text indexes

G Navarro, V Mäkinen - ACM Computing Surveys (CSUR), 2007 - dl.acm.org
Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …

Efficient architecture-aware acceleration of BWA-MEM for multicore systems

M Vasimuddin, S Misra, H Li… - 2019 IEEE international …, 2019 - ieeexplore.ieee.org
Innovations in Next-Generation Sequencing are enabling generation of DNA sequence data
at ever faster rates and at very low cost. For example, the Illumina NovaSeq 6000 sequencer …

Single-cell omics: experimental workflow, data analyses and applications

F Sun, H Li, D Sun, S Fu, L Gu, X Shao, Q Wang… - Science China Life …, 2024 - Springer
Cells are the fundamental units of biological systems and exhibit unique development
trajectories and molecular features. Our exploration of how the genomes orchestrate the …

BWA-MEME: BWA-MEM emulated with a machine learning approach

Y Jung, D Han - Bioinformatics, 2022 - academic.oup.com
Motivation The growing use of next-generation sequencing and enlarged sequencing
throughput require efficient short-read alignment, where seeding is one of the major …

TopHat: discovering splice junctions with RNA-Seq

C Trapnell, L Pachter, SL Salzberg - Bioinformatics, 2009 - academic.oup.com
Motivation: A new protocol for sequencing the messenger RNA in a cell, known as RNA-
Seq, generates millions of short sequence fragments in a single run. These fragments, or …

Ultrafast and memory-efficient alignment of short DNA sequences to the human genome

B Langmead, C Trapnell, M Pop, SL Salzberg - Genome biology, 2009 - Springer
Bowtie is an ultrafast, memory-efficient alignment program for aligning short DNA sequence
reads to large genomes. For the human genome, Burrows-Wheeler indexing allows Bowtie …

[HTML][HTML] Replacing suffix trees with enhanced suffix arrays

MI Abouelhoda, S Kurtz, E Ohlebusch - Journal of discrete algorithms, 2004 - Elsevier
The suffix tree is one of the most important data structures in string processing and
comparative genomics. However, the space consumption of the suffix tree is a bottleneck in …

Compressed suffix arrays and suffix trees with applications to text indexing and string matching

R Grossi, JS Vitter - Proceedings of the thirty-second annual ACM …, 2000 - dl.acm.org
The proliferation of online text, such as on the World Wide Web and in databases, motivates
the need for space-efficient index methods that support fast search. Consider a text T of n …

[图书][B] Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences

G Navarro, M Raffinot - 2002 - books.google.com
Recent years have witnessed a dramatic increase of interest in sophisticated string matching
problems, especially in information retrieval and computational biology. This book presents …

PRICE: software for the targeted assembly of components of (Meta) genomic sequence data

JG Ruby, P Bellare, JL DeRisi - G3: Genes, Genomes, Genetics, 2013 - academic.oup.com
Low-cost DNA sequencing technologies have expanded the role for direct nucleic acid
sequencing in the analysis of genomes, transcriptomes, and the metagenomes of whole …