scientific article; zbMATH DE number 1998299
From MaRDI portal
Publication:4432944
zbMath1040.68064MaRDI QIDQ4432944
No author found.
Publication date: 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial algorithmslongest increasing subsequence problemclosed sets of permutationsgenome aligninglongest subsequence problemsubpermutation recognition problem
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Protein sequences, DNA sequences (92D20)
Related Items (3)
A fast algorithm for permutation pattern matching based on alternating runs ⋮ On the longest increasing subsequence of a circular list ⋮ The longest almost-increasing subsequence
This page was built for publication:
