✦ LIBER ✦

Minimal string difference encodings

✍ Scribed by Robert N Goldberg

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 535 KB
Volume: 3
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(82)90014-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

MSHSM – Minimal Standard Heterotic Strin

MSHSM – Minimal Standard Heterotic String Models

✍ A.E. Faraggi 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

## Abstract An overview of old and new results in studies of the quasi‐realistic free fermionic models is presented, which include the recent discovery of exophobic string vacua and reproduction of the Higgs‐matter splitting mechanism in a corresponding orbifold construction.

Minimal error difference formulas

✍ Herbert E. Salzer 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 418 KB

The usual formula for the rth difference of f(X), at intervals of h, may introduce an error of 2re, where e is" tlSe ierror[ in f(X). When f(X) is either an exact polynomial of the nth degree, or very closely approximated by one within a finite interval, say [-1, 1], the rth difference, at X = X0, i

Computing Permutation Encodings

✍ K. Rustan M. Leino 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 127 KB

Matching for Run-Length Encoded Strings

✍ Alberto Apostolico; Gad M Landau; Steven Skiena 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Parallel processing of encoded bit strin

Parallel processing of encoded bit strings

✍ Angela Y. Wu; Azriel Rosenfeld 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Edit distance of run-length encoded stri

Edit distance of run-length encoded strings

✍ Ora Arbell; Gad M. Landau; Joseph S.B. Mitchell 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l + |Y |k) time algorithm that computes their edit distance.