Comment on “Language Trees and Zipping

Physical Review Letters

Volumn 90, Issue 8, 2003, Pages

  Khmelev, Dmitry V ^a,b   Teahan, William J ^c  

^a Heriot Watt University Edinburgh United Kingdom and Moscow State University Moscow ^*  (United Kingdom)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF WALES   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ALGORITHM; ENTROPY; GENETICS; LANGUAGE; PROBABILITY; THEORETICAL MODEL;

ALGORITHMS; DNA; ENTROPY; LANGUAGE; MARKOV CHAINS; MODELS, THEORETICAL;

ALGORITHMS; APPROXIMATION THEORY; DNA SEQUENCES; MARKOV PROCESSES; MATHEMATICAL MODELS;

ALPHABET; DNA ANALYSIS; LANGUAGE TREES; MARKOV CHAIN MODELS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 0037471057     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.90.089803     Document Type: Erratum

References (9)

1. D. Benedetto, E. Caglioti, and V. Loreto, Phys. Rev. Lett.10.1103/PhysRevLett.88.048702 88, 048702 (2002).
2. D. Gusfield, Algorithms on Strings, Trees, and Sequences (Cambridge University Press, Cambridge, 1997).
3. C. Shannon, Bell Syst. Tech. J. 27, 379–423 (1948);
4. C. ShannonBell Syst. Tech. J.27, 623–656 (1948).
5. A. Yaglom and I. Yaglom, Probability and Information (Reidel, Boston, 1983).
6. O. Kukushkina, A. Polikarpov, and D. Khmelev, Probl. Inf. Transm. (Engl. Transl.)PRITA910.1023/A:1010478226705 37, 172 (2001).
7. J.G. Cleary and I.H. Witten, IEEE Trans. Commun. 32, 396–402 (1984).
8. D. Khmelev, J. Quant. Linguistics 7, 201 (2000).
9. W.J. Teahan, in Proceedings of RIAO ’2000, Content-Based Multimedia Information Access (Collége de France, Paris, France, 2000), Vol.�2, p.�943.