Dynamic and Internal Longest Common Substring

Given two strings S and T , each of length at most n , the longest common substring (LCS) problem is to find a longest substring common to S and T . This is a classical problem in computer science with an O ( n ) -time solution. In the fully dynamic setting, edit operations are allowed in either of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 82; H. 12; S. 3707 - 3743
Hauptverfasser:	Amir, Amihood, Charalampopoulos, Panagiotis, Pissis, Solon P., Radoszewski, Jakub
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.12.2020 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data structures Data Structures and Information Theory Mathematics of Computing Queries Strings Theory of Computation String algorithms Longest common substring Dynamic algorithms
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!