Faster STR-EC-LCS Computation (Q3297762)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Faster STR-EC-LCS Computation	scientific article

Statements

scholarly article

0 references

Faster STR-EC-LCS Computation (English)

0 references

0 references

0 references

Shunsuke Inenaga

0 references

0 references

Masayuki Takeda

0 references

SOFSEM 2020: Theory and Practice of Computer Science

0 references

publication date

20 July 2020

0 references

full work available at URL

https://arxiv.org/abs/2001.05671

0 references

MaRDI profile type

MaRDI publication profile

0 references

An improved algorithm for computing the edit distance of run-length coded strings

0 references

On the generalized constrained longest common subsequence problems

0 references

A simple algorithm for the constrained sequence problems

0 references

Quadratic-time algorithm for a string constrained LCS problem

0 references

A hardness result and new algorithm for the longest common palindromic subsequence problem

0 references

Faster STR-IC-LCS Computation via RLE

0 references

A longest common subsequence algorithm suitable for similar text strings

0 references

The constrained longest common subsequence problem

0 references

The String-to-String Correction Problem

0 references

A dynamic programming solution to a generalized LCS problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-38919-2_11

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3297762

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3297762&oldid=36601562"