@article{RAIHA1981187,
    Author = {R{\"a}ih{\"a}, Kari-Jouko and Ukkonen, Esko},
    File = {1-s2.0-030439758190075X-main (0) - a - a - f.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Number = {2},
    Pages = {187 - 198},
    Title = {The shortest common supersequence problem over binary alphabet is NP-complete},
    URL = {http://www.sciencedirect.com/science/article/pii/030439758190075X},
    Volume = {16},
    Year = {1981},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439758190075X},
    bdsk-url-2 = {https://doi.org/10.1016/0304-3975(81)90075-X},
    date-added = {2018-03-03 10:37:32 +0000},
    date-modified = {2018-03-03 10:37:32 +0000},
    doi = {10.1016/0304-3975(81)90075-X}
}

@article{RAIHA1981187, Author = {R{\"a}ih{\"a}, Kari-Jouko and Ukkonen, Esko}, File = {1-s2.0-030439758190075X-main (0) - a - a - f.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Number = {2}, Pages = {187 - 198}, Title = {The shortest common supersequence problem over binary alphabet is NP-complete}, URL = {http://www.sciencedirect.com/science/article/pii/030439758190075X}, Volume = {16}, Year = {1981}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439758190075X}, bdsk-url-2 = {https://doi.org/10.1016/0304-3975(81)90075-X}, date-added = {2018-03-03 10:37:32 +0000}, date-modified = {2018-03-03 10:37:32 +0000}, doi = {10.1016/0304-3975(81)90075-X} }