مرکز منطقه ای اطلاع رساني علوم و فناوري - An almost-linear time and linear space algorithm for the longest common subsequence problem

Title of article :

An almost-linear time and linear space algorithm for the longest common subsequence problem

Author/Authors :

J.Y. Guo، نويسنده , , F.K. Hwang، نويسنده ,

Issue Information :

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

Pages :

From page :

131

To page :

135

Keywords :

Algorithms , Primal-dual algorithm , Longest common subsequence

Journal title :

Information Processing Letters

Serial Year :

2005

Journal title :

Information Processing Letters

Record number :

130071

Link To Document :