| Name | psuffix-trees JSON |
| Version |
1.0.0
JSON |
| download |
| home_page | None |
| Summary | A Python port of the Matlab probabilistic suffix trees and automata library by Markowitz |
| upload_time | 2024-12-02 20:27:01 |
| maintainer | None |
| docs_url | None |
| author | None |
| requires_python | >=3.7 |
| license | MIT License Copyright (c) 2024 Russell McLoughlin Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
| keywords |
pst
probabilistic suffix trees
python
|
| VCS |
 |
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
# psuffix-trees
A Python port of the Matlab probabilistic suffix trees and automata library by Markowitz (https://github.com/jmarkow/pst)
This port is an implementation probabilistic suffix trees by Ron, Singer and Tishby 1996.
## How to use
### Simple Example
You'll need a dataset of sequences. There is a nice example in `pypst/fixtures/output_symbols.json` if you want something to play around with.
```
dataset = [
"VHDEFAZDEFABGNVbEFKJaSAHDHD",
"BN",
"CTCQMTJcO",
...
]
from pypst import PST
pst = PST(
L = 2,
p_min = 0.0073,
g_min = .01,
r = 1.6,
alpha = 17.5,
)
pst.fit(dataset)
pst.tree
```
### Any sequence that is iterable is acceptable
Setup your dataset of sequences
```
dataset = [
"VHDEFAZDEFABGNVbEFKJaSAHDHD",
"BN",
"CTCQMTJcO",
...
]
```
Your dataset entries can be any sequence whether its string, list or tuple.
```
dataset = [
['1','2','3'],
['2','4','7','8']
['5','1','2']
]
```
Raw data
{
"_id": null,
"home_page": null,
"name": "psuffix-trees",
"maintainer": null,
"docs_url": null,
"requires_python": ">=3.7",
"maintainer_email": null,
"keywords": "pst, probabilistic suffix trees, python",
"author": null,
"author_email": "Russell McLoughlin <russ.mcl@gmail.com>",
"download_url": "https://files.pythonhosted.org/packages/71/bf/bf3aebce90cb12f748f4aecfea87f17bcfeb687d9eab299b9eef2d312055/psuffix_trees-1.0.0.tar.gz",
"platform": null,
"description": "# psuffix-trees\n\nA Python port of the Matlab probabilistic suffix trees and automata library by Markowitz (https://github.com/jmarkow/pst)\n\nThis port is an implementation probabilistic suffix trees by Ron, Singer and Tishby 1996.\n\n## How to use\n\n### Simple Example\n\nYou'll need a dataset of sequences. There is a nice example in `pypst/fixtures/output_symbols.json` if you want something to play around with.\n\n```\ndataset = [\n \"VHDEFAZDEFABGNVbEFKJaSAHDHD\",\n \"BN\",\n \"CTCQMTJcO\",\n ...\n]\n\nfrom pypst import PST\n\npst = PST(\n L = 2,\n p_min = 0.0073,\n g_min = .01,\n r = 1.6,\n alpha = 17.5,\n)\n\npst.fit(dataset)\n\npst.tree\n```\n\n### Any sequence that is iterable is acceptable\n\nSetup your dataset of sequences\n```\ndataset = [\n \"VHDEFAZDEFABGNVbEFKJaSAHDHD\",\n \"BN\",\n \"CTCQMTJcO\",\n ...\n]\n```\n\nYour dataset entries can be any sequence whether its string, list or tuple.\n\n```\ndataset = [\n ['1','2','3'],\n ['2','4','7','8']\n ['5','1','2']\n]\n```\n",
"bugtrack_url": null,
"license": "MIT License Copyright (c) 2024 Russell McLoughlin Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ",
"summary": "A Python port of the Matlab probabilistic suffix trees and automata library by Markowitz",
"version": "1.0.0",
"project_urls": {
"Homepage": "https://github.com/rmcl/psuffix-trees"
},
"split_keywords": [
"pst",
" probabilistic suffix trees",
" python"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "fe6e215e30875178cc69b452f3e4e56efda172fe1ab46686f187324f9772be1c",
"md5": "511a39d375bfce6aa0f80ca0c3166665",
"sha256": "01a72fa7e1fef100ddbe7721460b9a7f180d799ba1ebd53eb303dc0740066f2e"
},
"downloads": -1,
"filename": "psuffix_trees-1.0.0-py3-none-any.whl",
"has_sig": false,
"md5_digest": "511a39d375bfce6aa0f80ca0c3166665",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.7",
"size": 11770,
"upload_time": "2024-12-02T20:26:59",
"upload_time_iso_8601": "2024-12-02T20:26:59.826016Z",
"url": "https://files.pythonhosted.org/packages/fe/6e/215e30875178cc69b452f3e4e56efda172fe1ab46686f187324f9772be1c/psuffix_trees-1.0.0-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "71bfbf3aebce90cb12f748f4aecfea87f17bcfeb687d9eab299b9eef2d312055",
"md5": "c9db74ba0f50b0f3754a109b1aaceced",
"sha256": "343422aba9e3130a9d900b8fc0c1a834e34658554c792283e02d5ba305dc21e8"
},
"downloads": -1,
"filename": "psuffix_trees-1.0.0.tar.gz",
"has_sig": false,
"md5_digest": "c9db74ba0f50b0f3754a109b1aaceced",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.7",
"size": 9138,
"upload_time": "2024-12-02T20:27:01",
"upload_time_iso_8601": "2024-12-02T20:27:01.612260Z",
"url": "https://files.pythonhosted.org/packages/71/bf/bf3aebce90cb12f748f4aecfea87f17bcfeb687d9eab299b9eef2d312055/psuffix_trees-1.0.0.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-12-02 20:27:01",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "rmcl",
"github_project": "psuffix-trees",
"travis_ci": false,
"coveralls": false,
"github_actions": false,
"lcname": "psuffix-trees"
}
