A linear algorithm for 3-letter longest common weakly increasing subsequence

2013
journal article
article
cris.lastimport.wos2024-04-09T20:41:24Z
dc.affiliationWydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznejpl
dc.contributor.authorDuraj, Lech - 133967 pl
dc.date.accessioned2014-07-17T11:11:58Z
dc.date.available2014-07-17T11:11:58Z
dc.date.issued2013pl
dc.description.number3pl
dc.description.physical94-99pl
dc.description.volume113pl
dc.identifier.doi10.1016/j.ipl.2012.11.007pl
dc.identifier.issn0020-0190pl
dc.identifier.urihttp://ruj.uj.edu.pl/xmlui/handle/item/101
dc.languageengpl
dc.language.containerengpl
dc.rights.licencebez licencji
dc.subtypeArticlepl
dc.titleA linear algorithm for 3-letter longest common weakly increasing subsequencepl
dc.title.journalInformation Processing Letterspl
dc.typeJournalArticlepl
dspace.entity.typePublication
cris.lastimport.wos
2024-04-09T20:41:24Z
dc.affiliationpl
Wydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznej
dc.contributor.authorpl
Duraj, Lech - 133967
dc.date.accessioned
2014-07-17T11:11:58Z
dc.date.available
2014-07-17T11:11:58Z
dc.date.issuedpl
2013
dc.description.numberpl
3
dc.description.physicalpl
94-99
dc.description.volumepl
113
dc.identifier.doipl
10.1016/j.ipl.2012.11.007
dc.identifier.issnpl
0020-0190
dc.identifier.uri
http://ruj.uj.edu.pl/xmlui/handle/item/101
dc.languagepl
eng
dc.language.containerpl
eng
dc.rights.licence
bez licencji
dc.subtypepl
Article
dc.titlepl
A linear algorithm for 3-letter longest common weakly increasing subsequence
dc.title.journalpl
Information Processing Letters
dc.typepl
JournalArticle
dspace.entity.type
Publication
Affiliations

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
4
Views per month
Views per city
Ashburn
1

No access

No Thumbnail Available