pattern-searching 0.1.0__tar.gz

pattern_searching-0.1.0/LICENSE

@@ -0,0 +1,36 @@
+⚖️ License
+
+This project is licensed under the MIT License – see the LICENSE
+ file for details.
+
+💡 Notes
+All algorithms are implemented in Python 3.
+Examples are included in each file for easy testing.
+You can adapt these algorithms for bioinformatics sequence analysis by replacing text with DNA/protein sequences.
+
+---
+
+## **LICENSE** (MIT License)
+
+```text
+MIT License
+
+Copyright (c) 2026 <Your Name>
+
+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.

pattern_searching-0.1.0/PKG-INFO

@@ -0,0 +1,88 @@
+Metadata-Version: 2.4
+Name: pattern_searching
+Version: 0.1.0
+Summary: Single-pattern and multiple-pattern string searching algorithms in Python
+Home-page: https://github.com/HADIL19/Pattern-Searching
+Author: Hadil Khelif
+Author-email: your_email@example.com
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.7
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: description
+Dynamic: description-content-type
+Dynamic: home-page
+Dynamic: license-file
+Dynamic: requires-python
+Dynamic: summary
+
+# Pattern Searching Algorithms
+
+This repository contains implementations of **single-pattern and multiple-pattern string searching algorithms** in Python.  
+It is designed for students, programmers, and bioinformatics enthusiasts to **learn, practice, and experiment with text and DNA/protein sequence analysis**.
+
+---
+
+## 🎯 Relevance to Bioinformatics
+
+Pattern searching is crucial in bioinformatics for tasks such as:
+
+- Finding **motifs in DNA sequences** (e.g., promoters, binding sites)  
+- Identifying **repeated sequences** or mutations in genomes  
+- Searching multiple motifs efficiently in large genomic datasets  
+
+These algorithms provide a foundation for understanding **sequence analysis, text processing, and data mining** in biological data.
+
+---
+
+## 🧩 Single-Pattern Algorithms (Recherche d’un seul motif)
+
+| Algorithm | Description |
+|-----------|-------------|
+| Naive | Simple brute-force search for a single pattern. |
+| Morris-Pratt | Optimized for repeated patterns using prefix preprocessing. |
+| Boyer-Moore | Skips unmatched characters using bad character heuristic. |
+| Rabin-Karp | Uses hashing for pattern search. |
+
+**Example:**
+
+```python
+from algorithms.single_pattern.naive import naive_search
+
+text = "ABABDABACDABABCABAB"
+pattern = "ABABCABAB"
+naive_search(text, pattern)
+🧩 Multiple-Pattern Algorithms (Recherche de plusieurs motifs)
+Algorithm	Description
+Rabin-Karp (Multiple)	Hash-based search for multiple patterns at once.
+Aho-Corasick	Builds a finite automaton for all patterns; very efficient for multiple patterns.
+Wu-Manber	Optimized multiple-pattern search using block shifts.
+Commentz-Walter	Combines Boyer-Moore logic with multiple-pattern optimization.
+
+Example:
+
+from algorithms.multiple_pattern.aho_corasick import AhoCorasick
+
+text = "ACGTACGTGACG"
+patterns = ["ACG", "GAC"]
+ac = AhoCorasick(patterns)
+ac.search(text)
+🚀 Usage
+Clone the repository:
+git clone https://github.com/<your-username>/Pattern-Searching-Algorithms.git
+cd Pattern-Searching-Algorithms
+Run any algorithm:
+python algorithms/single_pattern/naive.py
+python algorithms/multiple_pattern/aho_corasick.py
+📚 Resources
+
+Check resources/pattern_searching_links.md for tutorials and detailed explanations:
+
+Pattern Searching on GeeksforGeeks
+KMP, Rabin-Karp, Boyer-Moore, Aho-Corasick tutorials
+Wu-Manber and Commentz-Walter references

pattern_searching-0.1.0/README.md

@@ -0,0 +1,65 @@
+# Pattern Searching Algorithms
+
+This repository contains implementations of **single-pattern and multiple-pattern string searching algorithms** in Python.  
+It is designed for students, programmers, and bioinformatics enthusiasts to **learn, practice, and experiment with text and DNA/protein sequence analysis**.
+
+---
+
+## 🎯 Relevance to Bioinformatics
+
+Pattern searching is crucial in bioinformatics for tasks such as:
+
+- Finding **motifs in DNA sequences** (e.g., promoters, binding sites)  
+- Identifying **repeated sequences** or mutations in genomes  
+- Searching multiple motifs efficiently in large genomic datasets  
+
+These algorithms provide a foundation for understanding **sequence analysis, text processing, and data mining** in biological data.
+
+---
+
+## 🧩 Single-Pattern Algorithms (Recherche d’un seul motif)
+
+| Algorithm | Description |
+|-----------|-------------|
+| Naive | Simple brute-force search for a single pattern. |
+| Morris-Pratt | Optimized for repeated patterns using prefix preprocessing. |
+| Boyer-Moore | Skips unmatched characters using bad character heuristic. |
+| Rabin-Karp | Uses hashing for pattern search. |
+
+**Example:**
+
+```python
+from algorithms.single_pattern.naive import naive_search
+
+text = "ABABDABACDABABCABAB"
+pattern = "ABABCABAB"
+naive_search(text, pattern)
+🧩 Multiple-Pattern Algorithms (Recherche de plusieurs motifs)
+Algorithm	Description
+Rabin-Karp (Multiple)	Hash-based search for multiple patterns at once.
+Aho-Corasick	Builds a finite automaton for all patterns; very efficient for multiple patterns.
+Wu-Manber	Optimized multiple-pattern search using block shifts.
+Commentz-Walter	Combines Boyer-Moore logic with multiple-pattern optimization.
+
+Example:
+
+from algorithms.multiple_pattern.aho_corasick import AhoCorasick
+
+text = "ACGTACGTGACG"
+patterns = ["ACG", "GAC"]
+ac = AhoCorasick(patterns)
+ac.search(text)
+🚀 Usage
+Clone the repository:
+git clone https://github.com/<your-username>/Pattern-Searching-Algorithms.git
+cd Pattern-Searching-Algorithms
+Run any algorithm:
+python algorithms/single_pattern/naive.py
+python algorithms/multiple_pattern/aho_corasick.py
+📚 Resources
+
+Check resources/pattern_searching_links.md for tutorials and detailed explanations:
+
+Pattern Searching on GeeksforGeeks
+KMP, Rabin-Karp, Boyer-Moore, Aho-Corasick tutorials
+Wu-Manber and Commentz-Walter references

pattern_searching-0.1.0/pattern_searching.egg-info/PKG-INFO

@@ -0,0 +1,88 @@
+Metadata-Version: 2.4
+Name: pattern_searching
+Version: 0.1.0
+Summary: Single-pattern and multiple-pattern string searching algorithms in Python
+Home-page: https://github.com/HADIL19/Pattern-Searching
+Author: Hadil Khelif
+Author-email: your_email@example.com
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Requires-Python: >=3.7
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: description
+Dynamic: description-content-type
+Dynamic: home-page
+Dynamic: license-file
+Dynamic: requires-python
+Dynamic: summary
+
+# Pattern Searching Algorithms
+
+This repository contains implementations of **single-pattern and multiple-pattern string searching algorithms** in Python.  
+It is designed for students, programmers, and bioinformatics enthusiasts to **learn, practice, and experiment with text and DNA/protein sequence analysis**.
+
+---
+
+## 🎯 Relevance to Bioinformatics
+
+Pattern searching is crucial in bioinformatics for tasks such as:
+
+- Finding **motifs in DNA sequences** (e.g., promoters, binding sites)  
+- Identifying **repeated sequences** or mutations in genomes  
+- Searching multiple motifs efficiently in large genomic datasets  
+
+These algorithms provide a foundation for understanding **sequence analysis, text processing, and data mining** in biological data.
+
+---
+
+## 🧩 Single-Pattern Algorithms (Recherche d’un seul motif)
+
+| Algorithm | Description |
+|-----------|-------------|
+| Naive | Simple brute-force search for a single pattern. |
+| Morris-Pratt | Optimized for repeated patterns using prefix preprocessing. |
+| Boyer-Moore | Skips unmatched characters using bad character heuristic. |
+| Rabin-Karp | Uses hashing for pattern search. |
+
+**Example:**
+
+```python
+from algorithms.single_pattern.naive import naive_search
+
+text = "ABABDABACDABABCABAB"
+pattern = "ABABCABAB"
+naive_search(text, pattern)
+🧩 Multiple-Pattern Algorithms (Recherche de plusieurs motifs)
+Algorithm	Description
+Rabin-Karp (Multiple)	Hash-based search for multiple patterns at once.
+Aho-Corasick	Builds a finite automaton for all patterns; very efficient for multiple patterns.
+Wu-Manber	Optimized multiple-pattern search using block shifts.
+Commentz-Walter	Combines Boyer-Moore logic with multiple-pattern optimization.
+
+Example:
+
+from algorithms.multiple_pattern.aho_corasick import AhoCorasick
+
+text = "ACGTACGTGACG"
+patterns = ["ACG", "GAC"]
+ac = AhoCorasick(patterns)
+ac.search(text)
+🚀 Usage
+Clone the repository:
+git clone https://github.com/<your-username>/Pattern-Searching-Algorithms.git
+cd Pattern-Searching-Algorithms
+Run any algorithm:
+python algorithms/single_pattern/naive.py
+python algorithms/multiple_pattern/aho_corasick.py
+📚 Resources
+
+Check resources/pattern_searching_links.md for tutorials and detailed explanations:
+
+Pattern Searching on GeeksforGeeks
+KMP, Rabin-Karp, Boyer-Moore, Aho-Corasick tutorials
+Wu-Manber and Commentz-Walter references

pattern_searching-0.1.0/pattern_searching.egg-info/SOURCES.txt

@@ -0,0 +1,8 @@
+LICENSE
+README.md
+pyproject.toml
+setup.py
+pattern_searching.egg-info/PKG-INFO
+pattern_searching.egg-info/SOURCES.txt
+pattern_searching.egg-info/dependency_links.txt
+pattern_searching.egg-info/top_level.txt

pattern_searching-0.1.0/pattern_searching.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

pattern_searching-0.1.0/pattern_searching.egg-info/top_level.txt

@@ -0,0 +1 @@
+

pattern_searching-0.1.0/pyproject.toml

@@ -0,0 +1,3 @@
+[build-system]
+requires = ["setuptools", "wheel"]
+build-backend = "setuptools.build_meta"

pattern_searching-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

pattern_searching-0.1.0/setup.py

@@ -0,0 +1,19 @@
+from setuptools import setup, find_packages
+
+setup(
+    name="pattern_searching",  # package name, must be unique on PyPI
+    version="0.1.0",
+    author="Hadil Khelif",
+    author_email="your_email@example.com",
+    description="Single-pattern and multiple-pattern string searching algorithms in Python",
+    long_description=open("README.md", "r", encoding="utf-8").read(),
+    long_description_content_type="text/markdown",
+    url="https://github.com/HADIL19/Pattern-Searching",
+    packages=find_packages(),
+    classifiers=[
+        "Programming Language :: Python :: 3",
+        "License :: OSI Approved :: MIT License",
+        "Operating System :: OS Independent",
+    ],
+    python_requires='>=3.7',
+)