https://github.com/mfa/longest-common-sequence
assist in finding the longest common sequence for a list of strings
https://github.com/mfa/longest-common-sequence
Last synced: 3 months ago
JSON representation
assist in finding the longest common sequence for a list of strings
- Host: GitHub
- URL: https://github.com/mfa/longest-common-sequence
- Owner: mfa
- Created: 2023-10-22T17:17:23.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2023-10-22T17:28:54.000Z (over 2 years ago)
- Last Synced: 2025-06-01T04:11:36.282Z (about 1 year ago)
- Language: HTML
- Size: 13.7 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
## find common sequence
[](https://github.com/mfa/longest-common-sequence/actions/workflows/tests.yaml)
deployed: https://lcs.madflex.de/
### problem definition
We have a set of strings and want to find common strings of them,
but we have a second set that should not match the found common strings.
The result is a string that is found in the first set, but not in any of the strings in the second set.
#### Example
set1: (positive set)
```
this dummy example.
example this
this example
```
common strings: ``this``, ``example``
set2: (negative set)
```
this foo
another not relevant string
```
resulting strings (positive for set1, negative for set2): ``example``
### local setup
```
pip install -r requirements.txt
uvicorn app.main:app --reload
```
### tests
```
pip install -r requirements.txt
pip install pytest pyyaml
python -m pytest
```