VALID DATA FOR DESIGN OF HEBREW LANGUAGE INFORMATION PROCESSING EQUIPMENTLADANY SP.1974; IN: INF. UTIL. PROC. 37TH ASIS ANNU. MEET. XI; ATLANTA, GA; 1974; WASHINGTON, D.C.; AM. SOC. INF. SCI.; DA. 1974; PP. 181-186; BIBL. 10REF.Conference Paper

A METHOD DEFINING A LIMITED SET OF CHARACTER-STRINGS WITH MAXIMAL COVERAGE OF A SAMPLE OF TEXT.HULTGREN J; LARSSON R.1973; TRITA-LIB-4020 A; SWED.; DA. 1973; PP. 1-9; BIBL. 5 REF.Report

A LONGEST COMMON SUBSEQUENCE ALGORITHM SUITABLE FOR SIMILAR TEXT STRINGSNAKATSU N; KAMBAYASHI Y; YAJIMA S et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 2; PP. 171-179; BIBL. 6 REF.Article

ON THE CHAIN CODE OF A LINEWU LD.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 3; PP. 347-353; BIBL. 9 REF.Article

PASTIME. A SYSTEM FOR FILE COMPRESSION.HULTGREN J; LARSSON R.1975; TRITA-LIB-4043; SWED.; DA. 1975; PP. 1-17; BIBL. 7 REF.Report

A COMMON BASIS FOR SIMILARITY MEASURES INVOLVING TWO STRINGSKASHYAP RL; OOMMEN BJ.1983; INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS; ISSN 0020-7160; GBR; DA. 1983; VOL. 13; NO 1; PP. 17-40; BIBL. 15 REF.Article

THE SHORTEST COMMON SUPERSEQUENCE PROBLEM OVER BINARY ALPHABET IS NP-COMPLETEKARI JOUKO RAIHA; UKKONEN E.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 187-198; BIBL. 7 REF.Article

AN OPTIMAL ALGORITHM FOR COMPUTING THE REPETITIONS IN A WORDCROCHEMORE M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 5; PP. 244-250; BIBL. 7 REF.Article

ON FINDING MINIMAL LENGTH SUPERSTRINGSGALLANT J; MAIER D; STORER JA et al.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 50-58; BIBL. 9 REF.Article

UNIFORMLY GROWING K-TH POWER-FREE HOMOMORPHISMSBRANDENBURG FJ.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 69-82; BIBL. 10 REF.Article

EXPLOITING MACHINE-SPECIFIC POINTER OPERATIONS IN ABSTRACT MACHINESFRASER CW; HANSON DR.1982; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1982; VOL. 12; NO 4; PP. 367-373; BIBL. 14 REF.Article

THE STRING MERGING PROBLEMITOGA SY.1981; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981; VOL. 21; NO 1; PP. 20-30; BIBL. 12 REF.Article

UNE PROCEDURE D'ANALYSE LEXICALE ECRITE EN LANGAGE FORTRANLEBART L.1981; CAH. ANAL. DONNEES; ISSN 0339-3097; FRA; DA. 1981; VOL. 6; NO 2; PP. 229-243; ABS. ENG/ARAArticle

AN ALTERNATE CHARACTERIZATION OF PREORDER, INORDER, AND POSTORDERMAURER WD.1981; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1981; VOL. 16; NO 10; PP. 60-61Article

A CORRECT PREPROCESSING ALGORITHM FOR BOYER-MOORE STRING-SEARCHINGRYTTER W.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 3; PP. 509-512; BIBL. 2 REF.Article

A NEW PROOF OF THE LINEARITY OF THE BOYER-MOORE STRING SEARCHING ALGORITHMGUIBAS LJ; ODLYZKO AM.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 672-682; BIBL. 11 REF.Article

STRINGS AND THE SEQUENCE ABSTRACTION IN PASCALSALE AHJ.1979; SOFTWARE AGE; USA; DA. 1979; VOL. 9; NO 8; PP. 671-683; BIBL. 3 REF.Article

ON THE WORST-EASE BEHAVIOR OF STRING-SEARCLING ALGORITHMS.RIVEST RL.1977; S.I.A.M.J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 669-674; BIBL. 5 REF.Article

UNTERSUCHUNGEN UEBER DIE AEHNLICHKEIT VON ZEICHENKETTEN IN GROSSEN DATENBESTAENDEN. = EXAMEN DE LA SIMILITUDE DE CHAINES DE SYMBOLES DANS D'IMPORTANTS STOCKS DE DONNEESVORWERK E.1977; BER. GESELLSCH. MATH. DATENVERARBEIT.; DTSCH.; DA. 1977; NO 114; PP. 1-105; BIBL. 1 P. 1/2; ISBN 3486211412Serial Issue

VARIABLE-LENGTH CHARACTER STRING ANALYSES OF THREE DATA-BASES, AND THEIR APPLICATION FOR FILE COMPRESSIONBARTON IJ; LYNCH MF; PETRIE JH et al.1974; IN: INF. 1. ASLIB CO-ORD. INDEXING GROUP. PROC. CONF.; DURHAM; 1973; LONDON; ASLIB; DA. 1974; PP. 154-162; BIBL. 11REF.Conference Paper

A VERY FAST ASSOCIATIVE METHOD FOR THE RECOGNITION AND CORRECTION OF MISSPELT, BASED ON REDUNDANT HASH ADDRESSINGKOHONEN T; REUHKALA E.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 807-809; BIBL. 13 REF.Conference Paper

THE SUPERMAC MACRO PROCESSOR IN PASCALBROWN PJ; OGDEN JA.1983; SOFTWARE, PRACTICE AND EXPERIENCE; ISSN 0038-0644; GBR; DA. 1983; VOL. 13; NO 4; PP. 295-304; BIBL. 8 REF.Article

MINIMAL STRING DIFFERENCE ENCODINGSGOLDBERG RN.1982; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 2; PP. 147-156; BIBL. 7 REF.Article

LINEAR ALGORITHM FOR DATA COMPRESSION VIA STRING MATCHINGRODEH M; PRATT VR; EVEN S et al.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 1; PP. 16-24; BIBL. 12 REF.Article

AN EFFECTIVE ALGORITHM FOR STRING CORRECTION USING GENERALIZED EDIT DISTANCES. I: DESCRIPTION OF THE ALGORITHM AND ITS OPTIMALITYKASHYAP RL; OOMMEN BJ.1981; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1981; VOL. 23; NO 2; PP. 123-142; BIBL. 23 REF.Article