✦ LIBER ✦

Fast computation of a longest increasing subsequence and application

✍ Scribed by Maxime Crochemore; Ely Porat

Book ID: 113641911
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 234 KB
Volume: 208
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.04.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the longest increasing subsequence of

On the longest increasing subsequence of a circular list

✍ M.H. Albert; M.D. Atkinson; Doron Nussbaum; Jörg-Rüdiger Sack; Nicola Santoro 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Fast evaluation of sequence pair in bloc

Fast evaluation of sequence pair in block placement by longest common subsequence computation

✍ Xiaoping Tang; Ruiqi Tian; Wong, D.F. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 335 KB

On computing the length of longest incre

On computing the length of longest increasing subsequences

✍ Michael L. Fredman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 780 KB

Simple and fast linear space computation

Simple and fast linear space computation of longest common subsequences

✍ Claus Rick 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 108 KB

A linear space algorithm for computing a

A linear space algorithm for computing a longest common increasing subsequence

✍ Yoshifumi Sakai 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 107 KB

An algorithm for the determination of a

An algorithm for the determination of a longest increasing subsequence in a sequence

✍ M. Orlowski; M. Pachter 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We present a simple, novel and efficient algorithm for the determination of a longest increasing subsequence in a given sequence of ,, numbers. Our algorithm performs in O(,~ log r) time in the worst case, where r is the size of the output, i.e. r is the length of the longest increasing subsequence