Sequence Comparison: Close and Open problems

Gabriele Lenzini

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    24 Downloads (Pure)

    Abstract

    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.
    Original languageUndefined
    Title of host publicationWorkshop ``La matematizzazione della Biologia: storia e problematiche attuali''
    EditorsP. Cerrai, P. Freguglia
    Place of PublicationUrbino (Italy)
    PublisherQuattroVenti
    Pages161-170
    Number of pages10
    ISBN (Print)88-392-0506-3
    Publication statusPublished - Sep 1997
    EventWorkshop ``La matematizzazione della Biologia: storia e problematiche attuali'' - Arcidosso, Italy
    Duration: 1 Sep 19971 Sep 1997

    Workshop

    WorkshopWorkshop ``La matematizzazione della Biologia: storia e problematiche attuali''
    Period1/09/971/09/97

    Keywords

    • EWI-1084

    Cite this