seed2lp 2.0.0__py3-none-any.whl

seed2lp-2.0.0.dist-info/METADATA

@@ -0,0 +1,404 @@
+Metadata-Version: 2.4
+Name: seed2lp
+Version: 2.0.0
+Summary: Seed searching from network as SBML using Logic programming
+Home-page: http://github.com/bioasp/seed2lp
+Author: Chabname Ghassemi Nedjad
+Author-email: chabname.ghassemi-nedjad@inria.fr
+License: GPL
+Keywords: Answer Set Programming,wrapper,clingo
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: ASP
+Description-Content-Type: text/markdown
+License-File: LICENCE.txt
+Requires-Dist: clyngor>=0.3.18
+Requires-Dist: pytest>=4.4.0
+Requires-Dist: biseau>=0.0.16
+Requires-Dist: cobra
+Requires-Dist: clyngor-with-clingo
+Requires-Dist: clingo-lpx
+Requires-Dist: pyyaml
+Requires-Dist: menetools
+Requires-Dist: padmet
+Requires-Dist: tqdm
+Provides-Extra: tests
+Requires-Dist: pytest; extra == "tests"
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: home-page
+Dynamic: license
+Dynamic: license-file
+Dynamic: summary
+
+# Seed2LP 
+
+Seed2LP is a Python tool that searches seeds in metabolic networks. It uses answer set programming (ASP) and provides three approaches for seed detection: 
+- [**Full network**](#full-network) mode, that activates all compounds of the metabolic network.
+- [**Target**](#target) mode, that activates metabolites of interest.
+- [**FBA**](#fba) mode, that randomly searches seeds ensuring a positive flux into the objective reaction 
+
+The notebook directory of this repo contains scripts that reproduce the results presented in the associated paper. 
+
+</br>
+<hr style="border: 4px outset" size="8" > 
+
+## Install
+
+**From github**
+```
+pip install git+https://github.com/bioasp/seed2lp
+```
+
+**From repository source after git clone**
+
+```
+pip install .
+```
+or
+```
+python setup.py install
+```
+
+
+</br>
+
+## Requirements
+
+Requires Python >= 3.10. 
+
+For below requirements, installing Seed2LP will install all needed packages if not already installed.
+
+
+
+|  name  |    version        |
+|:----------:|:-------------:|
+| [clyngor](https://github.com/Aluriak/clyngor) | 0.3.18 |
+| [clingo-lpx](https://github.com/potassco/clingo-lpx) | 1.3.0   |
+| [cobrapy](https://cobrapy.readthedocs.io/en/latest/index.html)  | 0.26.0 |
+| [pyyaml](https://pyyaml.org/wiki/PyYAMLDocumentation) | 6.0 |
+| [menetools](https://github.com/cfrioux/MeneTools) | 3.4.0 |
+| [padmet](https://github.com/AuReMe/padmet) | 5.0.1 |
+
+<hr style="border: 4px outset" size="8" > 
+
+## Command examples
+The following examples uses a toy described on Seed2LP paper.
+
+> Get all solutions in all Target modes (Reasoning, Filter, Guess&Check, Guess&Check with Diversity, Hybrid lpx), in all optimisations (subset minimal and minimize)
+>```
+>seed2lp target networks/toys/SBML/toy_paper.SBML results/toys/
+>```
+
+> Get one solution in Full Network in reasoning and check flux
+>```
+>seed2lp full networks/toys/SBML/toy_paper.SBML results/toys/ -nbs 1 -so reasoning -cf
+>```
+
+> Get one solution in FBA only in subset minimal
+>```
+>seed2lp fba networks/toys/SBML/toy_paper.SBML results/toys/ -nbs 1 -m subsetmin
+>```
+
+<hr style="border: 4px outset" size="8" > 
+
+## 📜[Network analyse](documentations/network_analyse.mkd)
+The first step of the tool is to read the network, analyse it to be able to perform a logic analyse of the Network, each reaction must be defined as follows:
+
+$$ Reaction: Set\{reactants\} ⟶ Set\{products\}  \quad  with \quad bounds = [0,\infty]$$
+
+
+For each reaction, multiple factors are verified and correction is done if needed such as swapping set of reactants and set of products if the boundaries of a reaction are negative or deleting reactions with null boundaries. A warning is outputted when changes are done. 
+
+📃 **Output example:**
+
+```
+WARNING : 
+ - R_R2: Deleted.
+     Boundaries was: [0.0 ; 0.0]
+ - R_R7: Reactants and products switched.
+     Boundaries was: [-1000.0 ; 0.0]
+      
+```
+
+## Search mode features
+It is possible to run Seed2LP for all the 3 modes ([**Full network**](#full-network), [**Target**](#target) and [**FBA**](#fba) by changing the command, and for each one to use specifics arguments.
+
+There are also 2 additional features:
+- [**Network**](#network): allows drawing the network from the ASP definition and checking the network ASP decription by comparing with the Cobrapy description, or write into an SBML file the corrected network (exchanging products and reactants or delteing reaction with all boundaries to 0)
+- [**Flux**](#flux): Allows checking the flux with Cobrapy from Seed2LP result files, or any file having the same json structure than Seed2LP.
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### 📜 [<ins>Full Network</ins>](documentations/full_network.mkd)
+This mode searches seeds with this goal: "activate"/"produce" all reaction/metabolites of the network.
+> 💻 **Command:**
+>
+> ```
+> seed2lp full [network_file] [output_directory] [arguments]
+> ```
+
+There are also two submodes:
+- 📜 [Reasoning](documentations/full_network.mkd#reasoning): Use ASP solving with clingo
+    - **Classic:** Use reasoning (logical, Boolean abstraction of metabolic activity) search only, without calculating flux into objective reaction
+  - **Filter:** Use reasoning search only, but for all results the flux is checked with [cobrapy](https://cobrapy.readthedocs.io/en/latest/index.html), and only the solutions having flux are returned.
+  - **Guess-check:** Use reasoning search and directly interact with the solver during solving by adding new constraints. Flux is checked with [cobrapy](https://cobrapy.readthedocs.io/en/latest/index.html) for every solution proposed by the solver and new constraints are derived out of it to guide the remaining solving process. All outputted solutions have flux natively.
+- 📜 [Hybrid](documentations/full_network.mkd#hybrid): Ensure the resulting model statisfies both logical and flux constraints using a hybrid ASP-LP solver.
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### 📜 [<ins>Target</ins>](documentations/target.mkd)
+This mode searches seeds with this goal: producing a set of metabolites, or if a reaction is given, ensuring the production of the reactants needed for its activation.
+> 💻 **Command:**
+>
+> ```
+> seed2lp target [network_file] [output_directory] [arguments]
+> ```
+
+There are also two submodes:
+- 📜 [Reasoning](documentations/target.mkd): Use ASP solving with clingo
+  - **Classic:** Use reasoning (logical, Boolean abstraction of metabolic activity) search only, without calculating flux into objective reaction
+    - **Filter:** Use reasoning search only, but for all results the flux is checked with [cobrapy](https://cobrapy.readthedocs.io/en/latest/index.html), and only the solutions having flux are returned.
+    - **Guess-check:** Use reasoning search and directly interact with the solver during solving by adding new constraints. Flux is checked with [cobrapy](https://cobrapy.readthedocs.io/en/latest/index.html) for every solution proposed by the solver and new constraints are derived out of it to guide the remaining solving process. All outputted solutions have flux natively.
+- 📜 [Hybrid](documentations/target.mkd): Ensure the resulting model statisfies both logical and flux constraints using a hybrid ASP-LP solver.
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### 📜 [<ins>FBA</ins>](documentations/fba.mkd)
+This mode randomly searches seeds by ensuring flux on objective reaction.
+
+> 💻 **Command:**
+>
+> ```
+> seed2lp fba [network_file] [output_directory] [arguments]
+> ```
+
+</br>
+<hr style="border: 4px outset" size="8" > 
+
+## set-mode features
+It is possible to choose what kind of set of seeds to search.
+
+### <ins>Subset minimal</ins>
+The subset minimal (submin) mode finds a set of seeds which satisfies all the constraints, then from this set, it tries to eliminate seeds until it finds the minimal set that will satisfy the constraints.
+
+This method of search **does not guarantee minimality** in terms of size of the set. But it can be a **faster way** to have set of seeds the most minimal possible from a set already validated.
+
+> 📃 **Example:**
+> 
+> Considering all the followings sets of seeds below, that statisfy constraints for the objective, which of them are subset minimal and will be selected?
+> 
+> |  Sets of seeds  |  is choosen ?   |  reasons   |
+> |:--------------:|:---------------:|:-------------:|
+> | {A,B,C,D,E}    |     no          |  {A,B,C} is a set of seeds included into this set|
+> | {A,B,C}        |     yes         | There is no other set smaller included in this set|
+> | {A,D,E,F}      |     no          |{A,D,F} is a set of seeds included into this set |
+> | {A,D,F}        |     yes         | There is no other set smaller included in this set |
+> | {A,C,E,F}      |     yes         |  There is no other set smaller included in this set|
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### <ins>Minimize</ins>
+The minimize (min) set-mode finds set of seeds of minimal size which satisfies all the constraints.
+
+This method of search **ensures minimality**. But it is computationally more demanding.
+
+> 📃 **Example:**
+> 
+> Considering all the followings sets of seeds below, that statisfy constraints for the objective, which of them are of minimal size and will be selected?
+>
+> |  Sets of seeds  |  is choosen ?   |  reasons   |
+> |:--------------:|:---------------:|:-------------:|
+> | {A,B,C,D,E}    |     no          | There is a smaller set of size 3 existing |
+> | {A,B,C}        |     yes         | This a one of the smaller set |
+> | {A,D,E,F}      |     no          | There is a smaller set of size 3 existing |
+> | {A,D,F}        |     yes         | This a one of the smaller set |
+> | {A,C,E,F}      |     no          | There is a smaller set of size 3 existing|
+
+</br>
+
+</br>
+<hr style="border: 4px outset" size="8" > 
+
+## Results
+For each mode, a result json file is created. This file will write all models for all submodes reasoning / hybrid and **set-mode** subset minimial / minimize.
+
+If the check-flux option is used, `-cf` / `--check-flux`, a tsv file is created with all the fluxes calculated with Cobrapy, and if hybrid submode or fba mode is used, the LP flux found (calculated from ASP).
+
+The results are also written in the terminal.
+
+</br>
+<hr style="border: 4px outset" size="8" > 
+
+## Additional features
+### 📜 [<ins>Network</ins>](documentations/network.mkd)
+This feature can reconstruct a very basic picture of the network from the ASP conversion of the source network (in SBML format).
+- It can create the picture with the reaction names, or without the reaction.
+- It can also create all the reactions description / formula from ASP and Cobrapy and give a difference of both contents.
+- It can write an SBML file derived from the SBML sources after correction of the network
+  - Deletion of reaction with boundaries [0,0]
+  - Exchanging set of reactants and products when boundaries negatives: ie [-1000, 0], [-100; -10], ...
+
+> 💻 **Command:**
+>
+> `seed2lp network [network_file] [output_directory] [arguments]`
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### 📜 [<ins>Flux</ins>](documentations/flux.mkd)
+This feature allows the calculation, using Cobrapy library, of the flux of the objective function from a result file of seed2lp and save them. This can be a validation of the solutions provided by Seed2LP.
+
+> 💻 **Command:**
+>
+> `seed2lp flux [network_file] [seed2lp_result_file]`
+
+
+
+> 📝 **Notes:**
+>
+> It is possible to do the flux calculation using Cobrapy directly after the seed search by using the argument `-cf` / `--check-flux` on each mode. A tsv file is created with all the fluxes calculated with Cobrapy, and if hybrid submode or fba mode is used, the LP flux found (calculated from ASP).
+
+</br>
+<hr style="border: 4px outset" size="8" > 
+
+## Main 📜 [options](documentations/options.mkd) for [search mode features](#search-mode-features)
+
+### <ins>Data given by user</ins>
+
+|       option           | short|  default |  description | search mode |
+|:----------------------:|:----:|:--------:|:------------:|:-------------:|
+| --targets-file         | -tf  | optional | List of metabolites⭐ and/or <br/>an objective🔆 reaction  as file  | Target |
+| --objective            | -o   | optional | An objective🔆 reaction <br/> as command line | Full Network and FBA |
+| --seeds-file           | -sf  | optional | List of metabolites⭐ known to be seeds and will <br/> be in the initial set of seeds| ALL |
+| --possible-seeds-file  | -psf | optional | List of metabolites⭐ among which the seed selection will be performed <br/> be in the set of seeds | ALL |
+| --forbidden-seeds-file | -fsf | optional | List of metabolites⭐ that can not <br/> be in the set of seeds | ALL |
+
+
+> 📝 **Notes:**
+>
+> **Target** search mode : 
+>
+> - If **no target file** given, the targets will be the **reactants of the objective reaction** found in the SBML file. The flux calculation will be done **on the objective objective reaction** found in the SBML file.
+> - If only **Metabolites** given in the file: the targets will be **these given metabolites**. The flux calculation will be done on the **objective objective reaction** found in the SBML file.
+> - If only **Reaction** given in the file: the targets will be the **reactants of the objective reaction** found in the SBML file. The flux calculation will be done **on this given reaction**
+> - If both **Metabolites** and **Reaction** given in the file: the targets will be **these given metabolites**. The flux calculation will be done **on this given reaction**
+>
+> **Full network** (**hybrid** submode) and **FBA** : 
+>
+>If no objective reaction given, the objective reaction will be the one found in the SBML file for flux calculation.
+
+> 💬 **Comments:**
+>
+> ⭐ One metabolite by line, must be prefixed with "M_" to fit the ID of the SBML file.
+>
+> 🔆 One Objective reaction only, must be prefixed with "R_" to fit the ID of the SBML file.
+
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### <ins>Set mode</ins>
+
+|    option   | short|  default |  description | search mode |
+|:-----------:|:----:|:--------:|:------------:|:-------------:|
+| --mode | -m | subsetmin | run different set modes: <br/> minimize, subsetmin, all | ALL |
+| --solve  | -so | reasoning | run different submodes: <br/> reasoning, filter, gues-check, hybrid, all | Full Network<br> and Target |
+
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### <ins>Set of seed restrictions</ins>
+
+|       option           | short|  default |  description | search mode |
+|:----------------------:|:----:|:--------:|:------------:|:-------------:|
+| --targets-as-seeds | -tas | False | If used, targets found are given, <br/> allowed to be in the set of seeds | ALL |
+| --topological-injection | -ti | False | If used, the exchange⭐ metabolite <br/> from source file are set as seeds directly | ALL |
+| --keep-import-reactions | -kir | False | If used, the exchange⭐ reactions <br/> are not deleted during the conversion to ASP| ALL |
+| --accumulation | -accu | False | If used, solutions with possible <br/> accumulating metabolites are allowed | Full Network <br/> and Target |
+
+
+> 💬 **Comments:**
+>
+> ⭐ An **exchange reaction** is defined as a reaction having **one or multiple metabolites** as reactants or products (while the other set must be empty), it represent import or export reactions, and can be reversible or not, written forwards or backwards:
+> - R ⟶ ∅  $\quad$|$\quad$ R ⟷  ∅ $\quad$|$\quad$ R ⟵  ∅
+> - ∅ ⟶ P  $\quad$|$\quad$ ∅ ⟷ P $\quad$|$\quad$ ∅ ⟵  P
+> 
+> An **exchange metabolite** will be the metabolite involved in the exchange reaction
+ 
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### <ins>Flux</ins>
+
+|       option           | short|  default |  description | search mode |
+|:----------------------:|:----:|:--------:|:------------:|:-------------:|
+| --check-flux | -cf | False  | If used, the Cobrapy flux calculation <br/> from seeds will be executed and saved | ALL |
+|  --maximize-flux | -max | False |  If used, the flux calculation <br/> with ASP will be maximized  | ALL⭐ |
+
+
+> 💬 **Comments:**
+>
+> ⭐ The option is used only in [Hybrid](documentations/hybrid.mkd) mode for [Full Network](documentations/full_network.mkd) and [Target](documentations/target.mkd) search mode features.
+
+
+</br>
+<hr style="border: 4px outset" size="8" > 
+
+## Configuration file
+The application has its own configuration file located [here: seed2lp/config.yaml](seed2lp/config.yaml).
+
+It is possible to use another configuration file by using the option `-conf` or `--config-file`.
+
+But all these configurations are overwritten by the arguments if used. The config file is used as "the default configuration" of your app.
+
+
+</br>
+<hr style="border: 4px outset" size="8" > 
+
+## Output files
+### Result file
+
+<br/>
+<hr style="border: 1px dotted" > 
+
+### Flux file
+
+
+</br>
+<hr style="border: 4px outset" size="8" > 
+<hr style="border: 4px outset" size="8" > 
+
+## Troubleshooting
+### GCC version
+Seed2Lp needs a gcc version >= 7. 
+
+
+> 💻 Linux Commands:
+>
+> **Check your version:**
+>```
+>gcc --version
+>```
+>
+> **Install latest version (here v11):**
+>```
+> sudo apt install gcc-11
+>```
+>
+> **Link to the latest version (here v11):**
+>```
+> sudo update-alternatives --install /usr/bin/gcc gcc /usr/bin/gcc-11 20
+>```
+> **Check your version:**
+>```
+>gcc --version
+>```

seed2lp-2.0.0.dist-info/RECORD

@@ -0,0 +1,53 @@
+seed2lp/__init__.py,sha256=zWlSZ8ABRjc2pvv4U3pQ3k6d_n783xGyYWLLH5SOzf0,394
+seed2lp/__main__.py,sha256=oaa-8aM5IR1vlws1fe4bz1ctHcJnWpHjhHglDMUgdmU,31891
+seed2lp/_version.py,sha256=iMaYTeNtl7FfwZYJd_11tQ8i8-zQy0TKwx6ZoTAuJWU,75
+seed2lp/argument.py,sha256=WatRTXyBsG-VtNw9GE1K_WmkvZDDVWPUzjs1v5Z0iKo,29716
+seed2lp/clingo_lpx.py,sha256=S0a91PI4kSjjuVVmWUyE21VgAclRUCIrB4vjP8bhaRo,9403
+seed2lp/color.py,sha256=GVRb5uuljv-EW9n7QFpaiXzZJ1-deIVXF4zoeVEepIc,715
+seed2lp/config.yaml,sha256=FosxRNjvm5vOO-mYH0Ado8EEc8KrNf92s36_3WiAI-U,1900
+seed2lp/description.py,sha256=vdOYsoOH5ySy2o2LJZCiqhreDaoZEzGVmEB8I7Oj7Iw,20106
+seed2lp/file.py,sha256=GDP3TlWHlfOvdbLMJ1J2GdP5z4mQT6h_6Mhagw9bzmk,4026
+seed2lp/flux.py,sha256=kN_O2ShrZy0I9kkIhV6b2GVplX755LSrgEKHG4n35Xc,15036
+seed2lp/linear.py,sha256=tpBd1-LouHof4_69pITDxxCkAV6uSlL3JRssnXeyTMo,22048
+seed2lp/log_conf.yaml,sha256=L50fqplrENJwZBK087pYpgaDss3JK0H3qUhbXxKWhec,507
+seed2lp/logger.py,sha256=4d8UBKkv7czcJ2B9qk2Zcc8OGR8aeHF5J51qcRHnFhk,3008
+seed2lp/metabolite.py,sha256=tlqYfmiybaXykIpDNA3qRmRPiO0Gso-DsZingJZtSj4,2120
+seed2lp/network.py,sha256=dbp1eEsenvImEOPn7mvBpJp-9VmUPCiquV-b3R78BAA,92038
+seed2lp/reaction.py,sha256=Ot-Bly2E-w0BNA6PXMFGDHvtU4EDUdm7G-wfa8gbB4g,9576
+seed2lp/reasoning.py,sha256=-rmHokcwlNgJ7ijFYDf6TRkLCwssyt2qoQWPs4kPu5I,21178
+seed2lp/reasoningcom.py,sha256=tgpwO7TcDk3d1zTfs-6W-8Lk54uzODra1CxwilWpywA,37791
+seed2lp/reasoninghybrid.py,sha256=Lsr8AWIbE5cL4uVchqCTp7aTW5KVy2_ejs7YIR5KK5Q,39266
+seed2lp/resmod.py,sha256=eSp0n7IjBRD15a4oKl69femmZGHkKDoF_mX5nIrczi4,3588
+seed2lp/sbml.py,sha256=7aBvsXLpIbZPByq3f74YyxbI191pNIqPFeocmaC0GJ8,10169
+seed2lp/scope.py,sha256=XiiYFf6cjP1pJ1f0nOg6FXxTl9wd0v_9mCdzlKpy5aM,5645
+seed2lp/solver.py,sha256=7B8hEW8WWEYYU39HIzQUwPSP17rcAjcsDKpMq0HjshU,16937
+seed2lp/temp_flux_com.py,sha256=9ceHfXZ2Thc5KtsRNTsawrvFOE-33HyNUU13I-pjviE,2553
+seed2lp/utils.py,sha256=s6aDOhymwuxVkHC9M3DQD3A1vkBrSmGgzKwYmZc62Ss,8493
+seed2lp/asp/atom_for_transfers.lp,sha256=w8Lg_s1bEcdsuBXBVlPgFpOhyZZcF0UyHOrDS4gLGtg,320
+seed2lp/asp/community_heuristic.lp,sha256=2FKrNLbIJG14QdjrEE0rMlGOP_l5mw9n2ZDoT5unRrc,140
+seed2lp/asp/community_search.lp,sha256=Q0yCdH2NufmXgyPMEdtlgFDAMR8uS92ExjYIar6Nwjk,703
+seed2lp/asp/constraints_targets.lp,sha256=uiVrXjKo19lES7LcNXA48Evl0PKPT3OoBAj7dGHSmeM,528
+seed2lp/asp/definition_atoms.lp,sha256=FuWXggEq0VHk9iW67-tjVVT-U71JI0wNalzmkTP4TDM,3583
+seed2lp/asp/enum-cc.lp,sha256=f9j25v4U75QPbJf8yjBdWuABd74cAebvC7vet69vTJ0,1316
+seed2lp/asp/flux.lp,sha256=vaKcTWUXvsmYyAa903zIrKr3_NKf5yzT94X_wV-AQkU,3596
+seed2lp/asp/limit_transfers.lp,sha256=R0xv5spWrmJtrkymCoJo-2kh7JDQYkDmdG0NTYxzzv8,411
+seed2lp/asp/maximize_flux.lp,sha256=L5u-gjlfYJncXEeg90y_GmM_XGSckjJPJ_7fcgVbVE8,46
+seed2lp/asp/maximize_produced_target.lp,sha256=Z-b9x1YEua489s1ydhVftB4K6RN1a53uX02dXh9WRFE,345
+seed2lp/asp/minimize.lp,sha256=y7xKdeCZAXLgJzCQ0Q5OSSqbRkP-CI4G8gTGsdubPW4,315
+seed2lp/asp/seed-solving.lp,sha256=uoVUEVpv0AXJzUae-uPKiHeN7mWO9fUCmRFSZ4yqSl4,5066
+seed2lp/asp/seed_external.lp,sha256=FGLXh9rfg3FtdkvPuEGIqCAgwTtFMlJZHopPmQxojlQ,45
+seed2lp/asp/show_seeds.lp,sha256=N3dKwHB1idgfFvxR5x-BpbCURIPo5knXJ9gdjxw9KN8,32
+seed2lp/asp/show_tranfers.lp,sha256=r5q1LsZ4JBZv7GhFLmTmzv592i9K4_-ppa-HVK7jMpY,20
+seed2lp/asp/test.lp,sha256=P79bIUCT_wZUho5oT1JLSfpRXbrnUXXgcg_hfeRGn-w,1199
+seed2lp-2.0.0.dist-info/licenses/LICENCE.txt,sha256=rymAta8z0pwrrZEKjbZ7sKE4SwTwIibuHYwF3cNo51w,7662
+tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+tests/fba.py,sha256=a7E82uLdYEWa2vU-XFrehx5mm-ET5xgOqIpdEjzckWc,5156
+tests/full_network.py,sha256=8WIqRbCz7N0US1lBMaYxFdcbsj1VhLI3Nbz2LC1oXHw,6001
+tests/normalization.py,sha256=DeW07Y7Zidp8Vm2ADUjgDjCLmTxvD5jll69AGJKUzC4,5895
+tests/target.py,sha256=_hGod6xEInMx1l4SD1iG2cnBxD7L7jdcM226x7AcrhM,9645
+tests/utils.py,sha256=TXMqUzrMAbY6A4J0F6xzXFB_fy7ppsq-RZxjLtXGVLQ,6688
+seed2lp-2.0.0.dist-info/METADATA,sha256=bICF5wLdg3HmTVBFQgjCMJzyfrfHsFv6320auCRqRIY,17359
+seed2lp-2.0.0.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+seed2lp-2.0.0.dist-info/entry_points.txt,sha256=eVeu66obgZSj5jsvbJ4mdtchMU7hkfQLFY8ThuU0GNA,50
+seed2lp-2.0.0.dist-info/top_level.txt,sha256=I0kzFikY6lfRvzNZbs01GkkBTRnGVHxvBmPhpr-hEaY,14
+seed2lp-2.0.0.dist-info/RECORD,,

seed2lp-2.0.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (80.9.0)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

seed2lp-2.0.0.dist-info/entry_points.txt

@@ -0,0 +1,2 @@
+[console_scripts]
+seed2lp = seed2lp.__main__:main

seed2lp-2.0.0.dist-info/licenses/LICENCE.txt

@@ -0,0 +1,145 @@
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+
+Everyone is permitted to copy and distribute verbatim copies of this license
+document, but changing it is not allowed.
+
+This version of the GNU Lesser General Public License incorporates the terms and
+conditions of version 3 of the GNU General Public License, supplemented by the
+additional permissions listed below.
+
+0. Additional Definitions.
+
+As used herein, “this License” refers to version 3 of the GNU Lesser General
+Public License, and the “GNU GPL” refers to version 3 of the GNU General Public
+License.
+
+“The Library” refers to a covered work governed by this License, other than an
+Application or a Combined Work as defined below.
+
+An “Application” is any work that makes use of an interface provided by the
+Library, but which is not otherwise based on the Library. Defining a subclass of
+a class defined by the Library is deemed a mode of using an interface provided
+by the Library.
+
+A “Combined Work” is a work produced by combining or linking an Application with
+the Library. The particular version of the Library with which the Combined Work
+was made is also called the “Linked Version”.
+
+The “Minimal Corresponding Source” for a Combined Work means the Corresponding
+Source for the Combined Work, excluding any source code for portions of the
+Combined Work that, considered in isolation, are based on the Application, and
+not on the Linked Version.
+
+The “Corresponding Application Code” for a Combined Work means the object code
+and/or source code for the Application, including any data and utility programs
+needed for reproducing the Combined Work from the Application, but excluding the
+System Libraries of the Combined Work.
+
+1. Exception to Section 3 of the GNU GPL.
+
+You may convey a covered work under sections 3 and 4 of this License without
+being bound by section 3 of the GNU GPL.
+
+2. Conveying Modified Versions.
+
+If you modify a copy of the Library, and, in your modifications, a facility
+refers to a function or data to be supplied by an Application that uses the
+facility (other than as an argument passed when the facility is invoked), then
+you may convey a copy of the modified version:
+
+    a) under this License, provided that you make a good faith effort to ensure
+    that, in the event an Application does not supply the function or data, the
+    facility still operates, and performs whatever part of its purpose remains
+    meaningful, or 
+    b) under the GNU GPL, with none of the additional permissions of this License 
+    applicable to that copy.
+
+3. Object Code Incorporating Material from Library Header Files.
+
+The object code form of an Application may incorporate material from a header
+file that is part of the Library. You may convey such object code under terms of
+your choice, provided that, if the incorporated material is not limited to
+numerical parameters, data structure layouts and accessors, or small macros,
+inline functions and templates (ten or fewer lines in length), you do both of
+the following:
+
+    a) Give prominent notice with each copy of the object code that the Library
+    is used in it and that the Library and its use are covered by this License.
+    b) Accompany the object code with a copy of the GNU GPL and this license
+    document.
+
+4. Combined Works.
+
+You may convey a Combined Work under terms of your choice that, taken together,
+effectively do not restrict modification of the portions of the Library
+contained in the Combined Work and reverse engineering for debugging such
+modifications, if you also do each of the following:
+
+    a) Give prominent notice with each copy of the Combined Work that the
+    Library is used in it and that the Library and its use are covered by this
+    License. 
+    b) Accompany the Combined Work with a copy of the GNU GPL and this
+    license document. 
+    c) For a Combined Work that displays copyright notices during execution, 
+    include the copyright notice for the Library among these notices, as well 
+    as a reference directing the user to the copies of the GNU GPL and this 
+    license document. 
+    d) Do one of the following:
+        0) Convey the Minimal Corresponding Source under the terms of this
+        License, and the Corresponding Application Code in a form suitable for,
+        and under terms that permit, the user to recombine or relink the
+        Application with a modified version of the Linked Version to produce a
+        modified Combined Work, in the manner specified by section 6 of the GNU
+        GPL for conveying Corresponding Source. 
+        1) Use a suitable shared library
+        mechanism for linking with the Library. A suitable mechanism is one that
+        (a) uses at run time a copy of the Library already present on the user's
+        computer system, and (b) will operate properly with a modified version
+        of the Library that is interface-compatible with the Linked Version.
+    e) Provide Installation Information, but only if you would otherwise be
+    required to provide such information under section 6 of the GNU GPL, and
+    only to the extent that such information is necessary to install and execute
+    a modified version of the Combined Work produced by recombining or relinking
+    the Application with a modified version of the Linked Version. (If you use
+    option 4d0, the Installation Information must accompany the Minimal
+    Corresponding Source and Corresponding Application Code. If you use option
+    4d1, you must provide the Installation Information in the manner specified
+    by section 6 of the GNU GPL for conveying Corresponding Source.)
+
+5. Combined Libraries.
+
+You may place library facilities that are a work based on the Library side by
+side in a single library together with other library facilities that are not
+Applications and are not covered by this License, and convey such a combined
+library under terms of your choice, if you do both of the following:
+
+    a) Accompany the combined library with a copy of the same work based on the
+    Library, uncombined with any other library facilities, conveyed under the
+    terms of this License. 
+    b) Give prominent notice with the combined library that part of it is a work 
+    based on the Library, and explaining where to find the accompanying 
+    uncombined form of the same work.
+
+6. Revised Versions of the GNU Lesser General Public License.
+
+The Free Software Foundation may publish revised and/or new versions of the GNU
+Lesser General Public License from time to time. Such new versions will be
+similar in spirit to the present version, but may differ in detail to address
+new problems or concerns.
+
+Each version is given a distinguishing version number. If the Library as you
+received it specifies that a certain numbered version of the GNU Lesser General
+Public License “or any later version” applies to it, you have the option of
+following the terms and conditions either of that published version or of any
+later version published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser General Public
+License, you may choose any version of the GNU Lesser General Public License
+ever published by the Free Software Foundation.
+
+If the Library as you received it specifies that a proxy can decide whether
+future versions of the GNU Lesser General Public License shall apply, that
+proxy's public statement of acceptance of any version is permanent authorization
+for you to choose that version for the Library.

seed2lp-2.0.0.dist-info/top_level.txt

@@ -0,0 +1,2 @@
+seed2lp
+tests