✦ LIBER ✦

Performance analysis of some simple heuristics for computing longest common subsequences

✍ Scribed by F. Chin; C. K. Poon

Publisher: Springer
Year: 1994
Tongue: English
Weight: 955 KB
Volume: 12
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01185429

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing a longest common subsequence f

Computing a longest common subsequence for a set of strings

✍ W. J. Hsu; M. W. Du 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 832 KB

Analysis of Evolutionary Algorithms for

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem

✍ Thomas Jansen; Dennis Weyland 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 429 KB

Numerical computation and analysis of th

Numerical computation and analysis of the Titchmarsh–Weyl mα(λ) function for some simple potentials

✍ M.R.M Witwit; N.A Gordon; J.P Killingbeck 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 110 KB

This article is concerned with the Titchmarsh-Weyl m ( ) function for the di erential equation d 2 y=d x 2 +[ -q(x)]y=0. The test potential q(x) = x 2 , for which the relevant m ( ) functions are meromorphic, having simple poles at the points = 4k + 1 and = 4k + 3, is studied in detail. We are able

Computer-assisted optimization in the de

Computer-assisted optimization in the development of high-performance liquid chromatographic methods for the analysis of some explosives and related compounds

✍ L. Didaoui; U. Lewin-Kretzschmar; A. Touabet; W. Engewald 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 556 KB