You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
The Longest Common Subsequence Problem A Finite Automata Approach
Implementation and Application of Automata
Springer, Berlin, Heidelberg, July 2003
Bořivoj Melichar, Tomáš Polcar
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
|Readers by professional status||Count||As %|
|Student > Ph. D. Student||1||33%|
|Student > Master||1||33%|
|Readers by discipline||Count||As %|