Pages that link to "Item:Q2390245"

The following pages link to Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (Q2390245):

Displayed 10 items.

• Versatile string kernels (Q391141) ‎ (← links)
• Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) ‎ (← links)
• A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) ‎ (← links)
• Parallel comparison of run-length-encoded strings on a linear systolic array (Q867612) ‎ (← links)
• Efficient algorithms for the block edit problems (Q963999) ‎ (← links)
• A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) ‎ (← links)
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) ‎ (← links)
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (Q2483205) ‎ (← links)
• An Opportunistic Text Indexing Structure Based on Run Length Encoding (Q2947038) ‎ (← links)
• From Sequence Mining to Multidimensional Sequence Mining (Q3627906) ‎ (← links)