Efficient computation of sequence mappability
type: Item
instance of: scholarly article
title: Efficient computation of sequence mappability
author: Panagiotis Charalampopoulos
author: Costas S. Iliopoulos
author: Tomasz Kociumaka
author: Solon P. Pissis
author: Jakub Radoszewski
author: Juliusz Straszyński
published in: Algorithmica
publication date: 2022-05-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/1807.11702
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7517141
zbMATH Keywords: sequence mappability
zbMATH Keywords: \(k\)-errata tree
zbMATH Keywords: Hamming distance
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4210367916
cites work: Longest common prefixes with \(k\)-mismatches and applications
cites work: Efficient computation of sequence mappability
cites work: Faster algorithms for 1-mappability of a sequence
cites work: Q6098775
cites work: Longest common prefixes with \(k\)-errors and applications
cites work: Lowest common ancestors in trees and directed acyclic graphs
cites work: Linear-time algorithm for long LCF with \(k\) mismatches
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Q5111799
cites work: Q4038677
cites work: On the sorting-complexity of suffix tree construction
cites work: Longest common substrings with \(k\) mismatches
cites work: Parallel string matching with k mismatches
cites work: On the complexity of \(k\)-SAT
cites work: Which problems have strongly exponential complexity?
cites work: Linear work suffix array construction
cites work: Efficient randomized pattern-matching algorithms
cites work: Q4547749
cites work: Longest common substring with approximately \(k\) mismatches
cites work: Efficient string matching with k mismatches
cites work: Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Longest common prefix with mismatches
cites work: Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
DOI: 10.1007/S00453-022-00934-Y
Recommended article: Efficient computation of sequence mappability
Recommended article: Faster algorithms for 1-mappability of a sequence
Recommended article: Longest common prefixes with \(k\)-mismatches and applications
Recommended article: Longest common prefix with mismatches
copyright license: Creative Commons Attribution 4.0 International
description: scientific article; zbMATH DE number 7517141