Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithms and Computation

From MaRDI portal
Publication:5897899
Jump to:navigation, search

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



Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5897899&oldid=16695913"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 17:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki