Algorithms and Computation
From MaRDI portal
Publication:5897899
DOI10.1007/11602613zbMath1175.68539OpenAlexW2304246803MaRDI QIDQ5897899
Stanley P. Y. Fung, Hong Zhu, Wun-Tat Chan, Deshi Ye, Yong Zhang
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)
Related Items (3)
A linear space algorithm for computing a longest common increasing subsequence ⋮ Computing a longest common subsequence that is almost increasing on sequences having no repeated elements ⋮ On the limiting law of the length of the longest common and increasing subsequences in random words
This page was built for publication: Algorithms and Computation