Publications
Search

Publications :: Search

An approximation algorithm for the shortest common supersequence problem: an experimental analysis.

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: An approximation algorithm for the shortest common supersequence problem: an experimental analysis.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2001
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Paolo Barone
    2. Paola Bonizzoni
    3. Gianluca Della Vedova
    4. Giancarlo Mauri
    Download (by DOI): 10.1145/372202.372275
    BibTeX: conf/sac/BaroneBVM01
    DBLP: db/conf/sac/sac2001.html#BaroneBVM01
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Conference
    Name: Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), March 11-14, 2001, Las Vegas, NV, USA 2001
    URL: http://doi.acm.org/10.1145/372202
    DBLP: db/conf/sac/sac2001.html