View in EDS

Polynomial-time equivalences and refined algorithms for longest common subsequence variants.

Saved in:
Bibliographic Details
Title: Polynomial-time equivalences and refined algorithms for longest common subsequence variants.
Authors: Asahiro, Yuichi1, asahiro@is.kyusan-u.ac.jp, Jansson, Jesper2, jj@i.kyoto-u.ac.jp, Lin, Guohui3, guohui@ualberta.ca, Miyano, Eiji1,4, miyano@ai.kyutech.ac.jp, Ono, Hirotaka5, ono@nagoya-u.jp, Utashima, Tadatoshi4, utashima.tadatoshi965@mail.kyutech.jp
Source: Discrete Applied Mathematics; Aug2024, Vol. 353, p44-64, 21p
Database: Applied Science & Technology Source
FullText Text:
  Availability: 0
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 177372702
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Polynomial-time equivalences and refined algorithms for longest common subsequence variants.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Asahiro%2C+Yuichi%22">Asahiro, Yuichi</searchLink><relatesTo>1</relatesTo>, <i>asahiro@is.kyusan-u.ac.jp</i><br /><searchLink fieldCode="AU" term="%22Jansson%2C+Jesper%22">Jansson, Jesper</searchLink><relatesTo>2</relatesTo>, <i>jj@i.kyoto-u.ac.jp</i><br /><searchLink fieldCode="AU" term="%22Lin%2C+Guohui%22">Lin, Guohui</searchLink><relatesTo>3</relatesTo>, <i>guohui@ualberta.ca</i><br /><searchLink fieldCode="AU" term="%22Miyano%2C+Eiji%22">Miyano, Eiji</searchLink><relatesTo>1,4</relatesTo>, <i>miyano@ai.kyutech.ac.jp</i><br /><searchLink fieldCode="AU" term="%22Ono%2C+Hirotaka%22">Ono, Hirotaka</searchLink><relatesTo>5</relatesTo>, <i>ono@nagoya-u.jp</i><br /><searchLink fieldCode="AU" term="%22Utashima%2C+Tadatoshi%22">Utashima, Tadatoshi</searchLink><relatesTo>4</relatesTo>, <i>utashima.tadatoshi965@mail.kyutech.jp</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Applied+Mathematics%22">Discrete Applied Mathematics</searchLink>; Aug2024, Vol. 353, p44-64, 21p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=177372702
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.dam.2024.04.006
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 44
    Titles:
      – TitleFull: Polynomial-time equivalences and refined algorithms for longest common subsequence variants.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Asahiro, Yuichi
      – PersonEntity:
          Name:
            NameFull: Jansson, Jesper
      – PersonEntity:
          Name:
            NameFull: Lin, Guohui
      – PersonEntity:
          Name:
            NameFull: Miyano, Eiji
      – PersonEntity:
          Name:
            NameFull: Ono, Hirotaka
      – PersonEntity:
          Name:
            NameFull: Utashima, Tadatoshi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 08
              Text: Aug2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 0166218X
          Numbering:
            – Type: volume
              Value: 353
          Titles:
            – TitleFull: Discrete Applied Mathematics
              Type: main
ResultId 1