✦ LIBER ✦

Another look at the “longest ascending subsequence” problem

✍ Scribed by Paul Pritchard

Publisher: Springer-Verlag
Year: 1981
Tongue: English
Weight: 215 KB
Volume: 16
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00289592

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the longest-common-

A fast algorithm for the longest-common-subsequence problem

✍ Amar Mukhopadhyay 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 696 KB

New systolic arrays for the longest comm

New systolic arrays for the longest common subsequence problem

✍ Yen-Chun Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 555 KB

The longest common subsequence problem f

The longest common subsequence problem for sequences with nested arc annotations

✍ Guohui Lin; Zhi-Zhong Chen; Tao Jiang; Jianjun Wen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The Longest Arc-Preserving Common Subsequence (LAPCS) Problem has been introduced in Evans (Algorithms and complexity for annotated sequence analysis, Ph.D. Thesis, University of Victoria, 199

Another look at some problems of the air

Another look at some problems of the air-sea interface

✍ G. D. Robinson 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 978 KB

A fast and practical bit-vector algorith

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem

✍ Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzon; James F. Reid 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Another look at the propagation constant

✍ T. Nánási 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 326 KB