Maximal Common Subsequence Algorithms (Q5140762): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Maximal Common Subsequence Algorithms
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized constrained longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for the constrained sequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal common subsequences and minimal common supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/8707/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2807021032 / rank
 
Normal rank
Property / title
 
Maximal Common Subsequence Algorithms (English)
Property / title: Maximal Common Subsequence Algorithms (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:22, 30 July 2024

scientific article; zbMATH DE number 7286727
Language Label Description Also known as
English
Maximal Common Subsequence Algorithms
scientific article; zbMATH DE number 7286727

    Statements