| Display title | Longest common subsequence |
| Default sort key | Longest Common Subsequence Problem |
| Page length (in bytes) | 36,259 |
| Namespace ID | 0 |
| Page ID | 236105 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 160 |
| Number of page watchers who visited in the last 30 days | 7 |
| Number of redirects to this page | 6 |
| Counted as a content page | Yes |
| Wikidata item ID | Q141001 |
| Local description | Algorithmic problem on pairs of sequences |
| Central description | the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible |
| Page image |  |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Poor Yorick (talk | contribs) |
| Date of page creation | 04:09, 29 May 2003 |
| Latest editor | Citation bot (talk | contribs) |
| Date of latest edit | 22:13, 6 April 2025 |
| Total number of edits | 559 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (6) | This page is a member of 6 hidden categories (help):
|
| Transcluded templates (80) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
| Background color inline style rule exists without a corresponding text color | 19 |
