A linear-space algorithm for the substring constrained alignment problem
type: Item
instance of: scholarly article
title: A linear-space algorithm for the substring constrained alignment problem
zbMATH Open document ID: 1397.68245
DOI: 10.1007/978-3-319-46049-9_2
author: Yoshifumi Sakai
publication date: 2018-10-17T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6957575
MaRDI profile type: Publication
full work available at URL: 978-3-319-46049-9 2
OpenAlex ID: W2522434697
Recommended article: On All-Substrings Alignment Problems
Recommended article: Q4952703
Recommended article: Implementation and Application of Automata
Recommended article: Sublinear Space Algorithms for the Longest Common Substring Problem
Recommended article: On the common substring alignment problem
Recommended article: An almost-linear time and linear space algorithm for the longest common subsequence problem
Recommended article: Efficient algorithms for the longest common subsequence problem with sequential substring constraints
Recommended article: On the Complexity of Constrained Sequences Alignment Problems
Recommended article: Q3143773
Recommended article: A versatile divide and conquer technique for optimal string alignment
description: scientific article; zbMATH DE number 6957575