Special Issue "Selected Papers from LATA 2010"

Quicklinks

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (1 August 2011)

Special Issue Editors

Guest Editor
Prof. Dr. Henning Fernau
Theoretical Computer Science, FB 4 - Abteilung Informatik, Universität Trier, D-54286 Trier, Germany
Website: https://www.uni-trier.de/index.php?id=49861&L=2
E-Mail: fernau@uni-trier.de
Phone: +49 (0)651 201 2827 (office), +49 (0)651 201 2836 (Secretariat)
Fax: +49 (0)651 201 3954
Interests: complexity theory; fixed parameter algorithms; formal languages; fractal geometry; learning algorithms (machine learning) and pattern recognition

Guest Editor
Prof. Dr. Carlos Martín-Vide
Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain
Website: http://grammars.grlmc.com/grlmc/PersonalPages/cmv/cmv.html
E-Mail: carlos.martin@urv.cat
Phone: +34 977 55 9543
Fax: +34 977 55 8386
Interests: mathematical linguistics; formal languages; molecular computing; computational linguistics

Special Issue Information

LATA is a yearly conference in theoretical computer science and its applications. LATA 2010 aimed at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). This Special Issue collects selected extended algorithm-oriented papers from LATA 2010 that were especially invited for this Special Issue.

Keywords

  • data and image compression
  • document engineering
  • grammatical inference and algorithmic learning
  • pattern matching and pattern recognition
  • text algorithms
  • text retrieval

Published Papers (3 papers)

Download All Papers
Sort by:
Display options:
Select articles Export citation of selected articles as:
Select/unselect all
Displaying article 1-3
p. 285-306
by  and
Algorithms 2011, 4(4), 285-306; doi:10.3390/a4040285
Received: 14 October 2011; in revised form: 26 October 2011 / Accepted: 26 October 2011 / Published: 31 October 2011
Show/Hide Abstract | PDF Full-text (521 KB) | HTML Full-text | XML Full-text
(This article belongs to the Special Issue Selected Papers from LATA 2010)
p. 262-284
by , ,  and
Algorithms 2011, 4(4), 262-284; doi:10.3390/a4040262
Received: 12 October 2011; Accepted: 14 October 2011 / Published: 26 October 2011
Show/Hide Abstract | PDF Full-text (536 KB) | HTML Full-text | XML Full-text
(This article belongs to the Special Issue Selected Papers from LATA 2010)
p. 223-238
by  and
Algorithms 2011, 4(4), 223-238; doi:10.3390/a4040223
Received: 12 October 2011; Accepted: 20 October 2011 / Published: 21 October 2011
Show/Hide Abstract | Cited by 3 | PDF Full-text (493 KB) | HTML Full-text | XML Full-text
(This article belongs to the Special Issue Selected Papers from LATA 2010)
Select/unselect all
Displaying article 1-3
Select articles Export citation of selected articles as:

Last update: 20 February 2014

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert