On-line string matching in highly similar DNA sequences

DOI10.1007/s11786-016-0280-2zbMath1409.68358OpenAlexW2583747808MaRDI QIDQ2363986

Nadia Ben Nsira, Mourad Elloumi, Thierry Lecroq

Publication date: 17 July 2017

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-016-0280-2

zbMATH Keywords

string matchingpattern matchingstringborderalgorithms on stringsalgorithm design

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items (1)

Unnamed Item

Cites Work

• Improved long-period generators based on linear recurrences modulo 2
• A simple fast hybrid pattern-matching algorithm
• A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
• Fast relative Lempel-Ziv self-index for similar sequences
• Suffix Tree of Alignment: An Efficient Index for Similar Data
• The exact online string matching problem
• Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
• Indexing Similar DNA Sequences
• EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
• Efficient string matching
• Fast Pattern Matching in Strings
• Faster algorithms for string matching with k mismatches
• Algorithms on Strings

This page was built for publication: On-line string matching in highly similar DNA sequences