Definition: Any string that can be obtained by deleting zero or more symbols from a given string.
See also substring, longest common subsequence.
Note: A substring is contiguous. A subsequence need not be.
From Algorithms and Theory of Computation Handbook, page 13-17, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 11 May 2006.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "subsequence", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 11 May 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/subsequence.html