A Technique of Algorithm Construction on Sequences

Authors:
J. Misra
Affiliations:
Department of Computer Science, University of Texas
Venue:
IEEE Transactions on Software Engineering
Year:
1978

Citing 0
Cited 2

Programming with sequences

ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
A CGM algorithm solving the longest increasing subsequence problem

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V

Quantified Score

Hi-index	0.00

Visualization

Abstract

A technique is presented which is shown to be useful in designing algorithms which operate on sequences (strings). A generalization of the principle is presented for more general data structure.