The importance of combinatorial algorithms has long been shown in engineering and scientific computing. With the demands of new applications and advance in technology, combinatorial algorithms will continue to play an important role in the emerging areas such as scientific data mining and computational biology. For example in building a search engine and in finding motif in DNA sequences, these problems involve a huge amount of data and demand highly efficient algorithms. New techniques on algorithm design and analysis must be developed to cope with the new challenges.
This special issue of the MCS journal will be devoted to the design and analysis of combinatorial algorithms. It is open to submission of papers from any authors. However, it may also contain some selected papers presented during the London Algorithmic Workshop (LAW) 2007 held in King's College London, UK.
The key topics include, but are not limited to :
- Coding and data compression
- Combinatorial optimization
- Complexity theory
- Discrete mathematics
- Online and approximation algorithms
- Pattern matching
- String processing and sequence analysis
Papers can be submitted to the guest editors.
Electronic submissions are encouraged. The message should contain (i) the abstract in ASCII and (ii) the whole paper in Postscript or PDF. Alternatively, authors can submit 6 hard copies by post.
All submitted papers will be refereed according to the usual refereeing process.
Deadline of submission:
Notification of acceptance/rejection:22 March 2007
22 June 2007
Department of Computer Science
King's College London
Strand, London
WC2R 2LS
United Kingdom
phone: +44 (0)20 78482843
fax: +44 (0)20 78482851
email: joseph.chan@kcl.ac.ukGaspard-Monge Institute
University of Marne-la-Vallée
5, bd Descartes, Champs-sur-Marne
F-77454 Marne-la-Vallée Cedex 2
France
phone: +33 1 6095 7563
fax: +33 1 6095 7557
email: Maxime.Crochemore@univ-mlv.fr