A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Longest Lyndon Substring After Edit

2018
*
Annual Symposium on Combinatorial Pattern Matching
*

*After*O(n) time and space preprocessing, our algorithm returns LLS(T ) in O(log n) time for any single character

*edit*. ...

*After*O(n) time and space preprocessing, our algorithm returns LLS(T ) in O(l log σ + log n) time for any block

*edit*where σ is the number of distinct characters in T . ... The goal there was to compute, given strings S and T , the

*longest*

*common*

*factor*of strings S and T where T is a string which is obtained by a single character

*edit*

*operation*

*on*T . ...

##
###
Longest Common Substring Made Fully Dynamic

2019
*
European Symposium on Algorithms
*

Given two strings S and T , each of length at most n, the

doi:10.4230/lipics.esa.2019.6
dblp:conf/esa/AmirCPR19
fatcat:vhha5ndeu5dyrkohazx5t43wmy
*longest**common*substring (LCS) problem is to find a*longest*substring*common*to S and T . ... In the fully dynamic setting,*edit**operations*are allowed in either of the two strings, and the problem is to find an LCS*after*each*edit*. ... Introduction Given two strings S and T , each of length at most n, the*longest**common*substring (LCS) problem, also known as the*longest**common**factor*problem, is to find a*longest*substring*common*to ...##
###
Dynamic and Internal Longest Common Substring

2020
*
Algorithmica
*

., and Urabe et al.) studied analogously restricted dynamic variants of problems

doi:10.1007/s00453-020-00744-0
fatcat:jqzu2ou4tvc4na72tdnriuhzom
*on*strings; specifically, computing the*longest*palindrome and the Lyndon*factorization*of a string*after*a single*edit*... 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. ... as you give appropriate credit to the original author(s) and the source, provide a link to the Creative*Commons*licence, and indicate if changes were made. ...##
###
Longest Common Substring Made Fully Dynamic
[article]

2018
*
arXiv
*
pre-print

In particular, we show how to return an LCS in Õ(n^2/3) time (or Õ(√(n)) time if

arXiv:1804.08731v2
fatcat:6uzghlv55zbptnt7mrr4rhk7da
*edits*are allowed in only*one*of the two strings)*after*each*operation*using Õ(n) space. ... In the fully dynamic version of the problem,*edit**operations*are allowed in either of the two strings, and we are asked to report an LCS*after*each such*operation*. ... Introduction*Longest**Common*Substring (LCS) Problem In the*longest**common*substring (LCS) problem, also known as*longest**common**factor*problem, we are given two strings S and T , each of length at most ...##
###
Longest Common Prefixes with k-Errors and Applications
[chapter]

2018
*
Lecture Notes in Computer Science
*

Notably, we show that our technique can be extended to the

doi:10.1007/978-3-030-00479-8_3
fatcat:2xhap3e2xfaihggp3p4ai365fa
*edit*distance model with the same time and space complexities. ... Specifically, our algorithms run in O(n log k n log log n) time*on*average using O(n) space. ... The*edit*distance between x and y is the minimum total cost of a sequence of*edit**operations*(insertions, deletions, substitutions) required to transform x into y. ...##
###
Avoiding approximate repetitions with respect to the longest common subsequence distance

2016
*
Involve. A Journal of Mathematics
*

In this paper, we show the existence of words avoiding approximate repetitions, where the measure of similarity between adjacent

doi:10.2140/involve.2016.9.657
fatcat:mnfsqn3wkzaidh2xtryxhx2dpy
*factors*is based*on*the length of the*longest**common*subsequence. ... In their work, they measured the similarity of x and x' using either the Hamming distance or the*edit*distance. ... The most*common*metrics used to measure the distance between strings are the*edit*distance, the Hamming distance, and the*longest**common*subsequence metric. ...##
###
Longest substring palindrome after edit

2018
*
Annual Symposium on Combinatorial Pattern Matching
*

In this paper, we consider the problem of finding the LSPal

doi:10.4230/lipics.cpm.2018.12
dblp:conf/cpm/FunakoshiNIBT18
fatcat:goydlmhzk5hm7mawyvdvsynv3q
*after*the string is*edited*. ... It is known that the length of the*longest*substring palindromes (LSPals) of a given string T of length n can be computed in O(n) time by Manacher's algorithm [J. ACM '75]. ...*operation**on*T . ...##
###
Longest Alignment with Edits in Data Streams
[article]

2017
*
arXiv
*
pre-print

We study the problem of identifying a

arXiv:1711.04367v1
fatcat:mmqpwmjtb5cy3nc5wxdj3jjzjy
*longest*substring of S and T that forms a d-near-alignment under the*edit*distance, in the simultaneous streaming model. ... We give several algorithms, including an exact*one*-pass algorithm that uses O(d^2+d n) bits of space. We couple these results with comparable lower bounds. ... It is also related to the*Longest**Common*Subsequence problem, in which the goal is to find the*longest**common*subsequence of S and T . ...##
###
Faster Queries for Longest Substring Palindrome After Block Edit

2019
*
Annual Symposium on Combinatorial Pattern Matching
*

We can preprocess T in O(n) time and space such that later, we can answer in O(log min{σ, log n}) time the

doi:10.4230/lipics.cpm.2019.27
dblp:conf/cpm/FunakoshiNIBT19
fatcat:6ojz4dt5q5gelczyamhz66cqhu
*longest*substring palindrome*after*a single character*edit**operation*(insertion, deletion, or ... In this paper, we consider the problem of finding the LSPal*after*the string is*edited*. ... [1] proposed an algorithm to find the*longest**common**factor*(LCF ) of two strings,*after*a single character*edit**operation*is performed in*one*of the strings. ...##
###
A Survey on Longest Common Subsequence

2018
*
International Journal for Research in Applied Science and Engineering Technology
*

This paper is a survey which briefly describes the successful attempts made to get the

doi:10.22214/ijraset.2018.4746
fatcat:b4e2dygazrccpaahekz6caczuq
*longest**common*subsequence of two strings. ... The main aim of this paper is to present a general observation of popular*longest**common*subsequence algorithms and study their functions in multiple applications. ... Some Related Works 1) The string*editing*problem is as attempt of transforming*edit**operation*to minimise the cost. ...##
###
Edit distance with move operations

2007
*
Journal of Discrete Algorithms
*

The traditional

doi:10.1016/j.jda.2005.01.010
fatcat:qjxzs63kvfhkrnpkr2lovh3seu
*edit*-distance problem is to find the minimum number of insert-character and delete-character (and sometimes change character)*operations*required to transform*one*string into another. ... Although a greedy algorithm is known to have poor (a polynomial*factor*) worst case performance, we present a polynomial time greedy algorithm for non-recursive moves which*on*a subclass of instances of ... Acknowledgements We thank Maxime Crochemore for suggesting the*edit*distance with the exchange*operation*, which helped to motivate this work. ...##
###
Edit Distance with Move Operations
[chapter]

2002
*
Lecture Notes in Computer Science
*

The traditional

doi:10.1007/3-540-45452-7_9
fatcat:mxbsmtdazbd53axrj6emobqfkq
*edit*-distance problem is to find the minimum number of insert-character and delete-character (and sometimes change character)*operations*required to transform*one*string into another. ... Although a greedy algorithm is known to have poor (a polynomial*factor*) worst case performance, we present a polynomial time greedy algorithm for non-recursive moves which*on*a sub class of instances of ... Acknowledgments We thank Maxime Crochemore for suggesting the*edit*distance with the exchange*operation*, which helped to motivate this work. ...##
###
Efficient algorithms for the block edit problems

2010
*
Information and Computation
*

In this paper, we focus

doi:10.1016/j.ic.2009.12.001
fatcat:5fethilqnfcunf2kf67ghrzifq
*on*the*edit*distance between two given strings where block-*edit**operations*are allowed and better fitting to the human natural*edit*behaviors. ... Then we show that with some preprocessing, the minimum block*edit*distances of these three problems can be obtained by dynamic programming in O(nm), O(nm log m) and O(nm 2 ) time, respectively, where n ... This internal node is the lowest*common*ancestor (LCA) of Y R j and some X R h , and our aim is to get the*longest**common*prefix (LCP) LCP Y R j , X R h . ...##
###
Edit Distance with Block Operations

2018
*
European Symposium on Algorithms
*

The

doi:10.4230/lipics.esa.2018.33
dblp:conf/esa/GanczorzGJK18
fatcat:kgeonzxmgfc7bfj6vxusxv5hc4
*edit*distance with block moves is equivalent, up to a constant*factor*, to the*common*string partition problem, in which we are given two strings s, t and the goal is to partition s into minimal number ... We consider the problem of*edit*distance in which block*operations*are allowed, i.e. we ask for the minimal number of (block)*operations*that are needed to transform a string s to t. ... It is folklore knowledge that*edit*distance with move*operations*corresponds to a*common*partition; more precisely, it is within constant*factor*of the minimal*common*partition. ...##
###
A Modification of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays
[chapter]

2005
*
Lecture Notes in Computer Science
*

Suffix trees are used for preprocessing the sequences allowing an O(1) running time computation of the

doi:10.1007/11532323_25
fatcat:dyplnkcednbohfqttzzdwmqfe4
*longest**common*extensions between substrings. ... We present a variation of the Landau-Vishkin algorithm which instead of suffix trees uses suffix arrays for computing the*longest**common*extensions, thereby improving actual space usage. ... We have shown that it is possible to change the Landau-Vishkin approximate string matching algorithm to use enhanced suffix arrays instead of suffix trees for its computation of*longest**common*extensions ...
« Previous

*Showing results 1 — 15 out of 41,217 results*