Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BYCC-BY - Uznanie autorstwa
 

Quasi-Linear-Time Algorithm for Longest Common Circular Factor

Uproszczony widok
dc.abstract.enWe introduce the Longest Common Circular Factor (LCCF) problem in which, given strings S and T of length at most n, we are to compute the longest factor of S whose cyclic shift occurs as a factor of T. It is a new similarity measure, an extension of the classic Longest Common Factor. We show how to solve the LCCF problem in O(n log^4 n) time using O(n log^2 n) space.
dc.affiliationUniwersytet Warszawski
dc.conference.countryWłochy
dc.conference.datefinish2019-06-20
dc.conference.datestart2019-06-18
dc.conference.placePisa
dc.conference.seriesCombinatorial Pattern Matching
dc.conference.seriesCombinatorial Pattern Matching
dc.conference.seriesshortcutCPM
dc.conference.shortcutCPM 2019
dc.conference.weblinkhttp://cpm2019.di.unipi.it/
dc.contributor.authorCrochemore,
dc.contributor.authorAlzamel,
dc.contributor.authorRadoszewski, Jakub
dc.contributor.authorRytter, Wojciech
dc.contributor.authorWiktor, Zuba
dc.contributor.authorTomasz, Waleń
dc.contributor.authorTomasz, Kociumaka
dc.contributor.authorCostas, Iliopoulos S.
dc.contributor.authorStraszyński, Juliusz
dc.date.accessioned2024-01-25T18:45:17Z
dc.date.available2024-01-25T18:45:17Z
dc.date.copyright2019-06-06
dc.date.issued2019
dc.description.accesstimeAT_PUBLICATION
dc.description.financeNie dotyczy
dc.description.versionFINAL_PUBLISHED
dc.identifier.doi10.4230/LIPICS.CPM.2019.25
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/117751
dc.identifier.weblinkhttps://drops.dagstuhl.de/opus/volltexte/2019/10496/
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages25:1--25:14
dc.rightsCC-BY
dc.sciencecloudnosend
dc.titleQuasi-Linear-Time Algorithm for Longest Common Circular Factor
dc.typeJournalArticle
dspace.entity.typePublication