@article{MIDDENDORF1993365,
    Author = {Middendorf, M.},
    File = {../.Trash/1-s2.0-030439758190075X-main0 (0).pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Number = {2},
    Pages = {365 - 369},
    Title = {The shortest common nonsubsequence problem is NP-complete},
    URL = {http://www.sciencedirect.com/science/article/pii/030439759390200D},
    Volume = {108},
    Year = {1993},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439759390200D},
    bdsk-url-2 = {https://doi.org/10.1016/0304-3975(93)90200-D},
    date-added = {2018-03-17 11:14:15 +0000},
    date-modified = {2018-03-17 11:14:15 +0000},
    doi = {10.1016/0304-3975(93)90200-D}
}

@article{MIDDENDORF1993365, Author = {Middendorf, M.}, File = {../.Trash/1-s2.0-030439758190075X-main0 (0).pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Number = {2}, Pages = {365 - 369}, Title = {The shortest common nonsubsequence problem is NP-complete}, URL = {http://www.sciencedirect.com/science/article/pii/030439759390200D}, Volume = {108}, Year = {1993}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439759390200D}, bdsk-url-2 = {https://doi.org/10.1016/0304-3975(93)90200-D}, date-added = {2018-03-17 11:14:15 +0000}, date-modified = {2018-03-17 11:14:15 +0000}, doi = {10.1016/0304-3975(93)90200-D} }