Indexing a sequence for mapping reads with a single mismatch

DOI10.1098/RSTA.2013.0167MaRDI QIDQ2955639zbMATH OpenOpenAlexWikidataFDO

Authors Maxime Crochemore, Alessio Langiu, M. Sohel Rahman

Publication date 13 January 2017

Published in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1098/rsta.2013.0167

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Cites work

• A fast algorithm for string matching with mismatches
• A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
• A Space-Economical Suffix Tree Construction Algorithm
• An adaptive hybrid pattern-matching algorithm on indeterminate strings
• Constructing suffix arrays in linear time
• Efficient string matching with k mismatches
• Fast Pattern Matching in Strings
• Fast pattern-matching on indeterminate strings
• Fast string matching with mismatches
• Faster algorithms for string matching with k mismatches
• From Nerode's congruence to suffix automata with mismatches
• Generalized String Matching
• Indexing compressed text
• Indexing factors with gaps
• Linear work suffix array construction
• On-line construction of suffix trees
• Parallel string matching with k mismatches
• Replacing suffix trees with enhanced suffix arrays
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches
• Text Indexing and Dictionary Matching with One Error
• When indexing equals compression, experiments with compressing suffix arrays and applications

Cited in

(1)

• Longest common prefix with mismatches

This page was built for publication: Indexing a sequence for mapping reads with a single mismatch

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2955639)