Reference : Sequence Comparison: Close and Open problems
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/46824
Sequence Comparison: Close and Open problems
English
Lenzini, Gabriele mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) >]
1998
Proc.~of Workshop ``La matematizzazione della Biologia: storia e problematiche attuali'', Arcidosso (GR), Italy
Quattro Venti, Urbino (Italy)
161-170
Yes
88-392-0506-3
La matematizzazione della Biologia: storia e problematiche attuali
1998
Arcidosso
Italy
[en] Comparing sequences is a very important activity both in computer science and in a many other areas as well. For example thank to text editors, everyone knows the particular instance of a sequence comparison problem knonw as ``string mathcing problem''. It consists in searching a given work eventually with errors, in a long text. Among the wide literature about sequence comparison problems this paper focuses on those problems which arestricty related with molecular biology. These problems are significant representatives of formal problems in the ``computational biology'', a discipline recently born whose aim is the formalization and the analysis of biological discrete problems. http://matrix.iei.pi.cnr.it/~lenzini/papers/pcr-cissc98.ps.gz 2018-09-18 22:51:18 +0000 2019-06-15 18:30:42 +0200
http://hdl.handle.net/10993/46824

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.