مرکز منطقه ای اطلاع رساني علوم و فناوري - Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism

Title of article :

Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism

Author/Authors :

Valerio Freschi، نويسنده , , Alessandro Bogliolo، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2004

Pages :

From page :

167

To page :

173

Keywords :

Longest common subsequence , Run-length encoding , String comparison , Parallel processing , Algorithms

Journal title :

Information Processing Letters

Serial Year :

2004

Journal title :

Information Processing Letters

Record number :

129897

Link To Document :