scientific article; zbMATH DE number 7564392

DOI10.4230/LIPIcs.WABI.2019.16zbMath1493.68411MaRDI QIDQ5091741

Alexander Tiskin

Publication date: 27 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sequence alignmentlocal alignmentmatrix searchingSmith-Waterman alignment

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Cites Work

• Faster subsequence recognition in compressed strings
• Semi-local string comparison: algorithmic techniques and applications
• Semi-local longest common subsequences in subquadratic time
• A faster algorithm computing string edit distances
• Parametric optimization of sequence alignment
• Classes of cost functions for string edit distance
• Perspectives of Monge properties in optimization
• Fast distance multiplication of unit-Monge matrices
• Fast and compact regular expression matching
• Monge properties, discrete convexity and applications
• Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints
• The theory and computation of evolutionary distances: Pattern recognition
• Algorithms on Strings, Trees and Sequences
• A CHARACTERIZATION OF THE MONGE PROPERTY AND ITS CONNECTION TO STATISTICS
• The String-to-String Correction Problem
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

This page was built for publication: