dcatoolkit 0.1.5__tar.gz → 0.1.7__tar.gz

{dcatoolkit-0.1.5 → dcatoolkit-0.1.7}/LICENSE

@@ -1,21 +1,21 @@
-MIT License
-
-Copyright (c) 2024 Raheel Syed Ahmed
-
-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.
+MIT License
+
+Copyright (c) 2024 Raheel Syed Ahmed
+
+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.

{dcatoolkit-0.1.5/src/dcatoolkit.egg-info → dcatoolkit-0.1.7}/PKG-INFO

@@ -1,57 +1,72 @@
-Metadata-Version: 2.1
-Name: dcatoolkit
-Version: 0.1.5
-Summary: Collection of useful modules and representations for managing DCA output data.
-Author-email: Raheel Syed Ahmed <raheelsyedahmed@gmail.com>
-Maintainer-email: Raheel Syed Ahmed <raheelsyedahmed@gmail.com>
-License: MIT License
-        
-        Copyright (c) 2024 Raheel Syed Ahmed
-        
-        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: dca,toolkit,DI,coevolution
-Classifier: Development Status :: 4 - Beta
-Classifier: Intended Audience :: Science/Research
-Classifier: Topic :: Scientific/Engineering :: Bio-Informatics
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.10
-Classifier: Programming Language :: Python :: 3.11
-Classifier: Programming Language :: Python :: 3.12
-Requires-Python: >=3.10
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Requires-Dist: biotite
-Requires-Dist: matplotlib>=3.8.0
-Requires-Dist: numpy>=1.26.0
-Requires-Dist: pandas>=2.1.0
-Requires-Dist: scikit-learn>=1.3
-Requires-Dist: scipy>=1.11.0
-Provides-Extra: tests
-Requires-Dist: pytest; extra == "tests"
-Provides-Extra: docs
-Requires-Dist: sphinx; extra == "docs"
-Requires-Dist: pdoc; extra == "docs"
-Requires-Dist: numpydoc; extra == "docs"
-Provides-Extra: lint
-Requires-Dist: ruffle; extra == "lint"
-
-# dcatoolkit
- Collection of useful modules and representations for managing DCA output data.
+Metadata-Version: 2.1
+Name: dcatoolkit
+Version: 0.1.7
+Summary: Collection of useful modules and representations for managing DCA output data.
+Author-email: Raheel Syed Ahmed <raheelsyedahmed@gmail.com>
+Maintainer-email: Raheel Syed Ahmed <raheelsyedahmed@gmail.com>
+License: MIT License
+        
+        Copyright (c) 2024 Raheel Syed Ahmed
+        
+        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: dca,toolkit,DI,coevolution
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Science/Research
+Classifier: Topic :: Scientific/Engineering :: Bio-Informatics
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: biotite
+Requires-Dist: matplotlib>=3.8.0
+Requires-Dist: numpy>=1.26.0
+Requires-Dist: pandas>=2.1.0
+Requires-Dist: scikit-learn>=1.3
+Requires-Dist: scipy>=1.11.0
+Provides-Extra: tests
+Requires-Dist: pytest; extra == "tests"
+Provides-Extra: docs
+Requires-Dist: sphinx; extra == "docs"
+Requires-Dist: pdoc; extra == "docs"
+Requires-Dist: numpydoc; extra == "docs"
+Provides-Extra: lint
+Requires-Dist: ruffle; extra == "lint"
+
+# dcatoolkit
+ Collection of useful modules and representations for managing DCA output data.
+
+## Major Sections
+### Representations
+  * Use Pairs to load lists, tuples, sets, and ndarrays with the correct orientation of elements. This will allow you to yield integer pairs that can be mirrored (where y becomes x and vice versa) and to subset various pairs.
+  * Use DirectInformationData to create 3-column structured ndarrays that can be sorted by "DI", mapped to a protein with a ResidueAlignment, and used to generate output for other programs (including UCSF Chimera)
+  * Use ResidueAlignment to generate a reference map. Indices of one sequence of characters can be linked to their corresponding indices of the other sequence of characters. The dictionaries produced, domain-to-protein and protein-to-domain, allow for forward mapping and backmapping.
+  * Use StructureInformation to find contacts in a protein structure and find atomic information related to specific pairs of interest.
+### Analytics
+  * Use MSATools to load in Multiple Sequence Alignment (MSA) data and provide functionality including generating frequency statistics on "gappiness" in the MSA and filtering and cleaning MSAs.
+
+
+## Diagram of Hidden Markov Machine & Direct Coupling Analysis Pipeline
+<p align="center">
+  <img src="https://github.com/user-attachments/assets/4768e08f-d513-4dbf-abc5-c80c1b3d42aa"/>
+</p>

dcatoolkit-0.1.7/README.md

@@ -0,0 +1,17 @@
+# dcatoolkit
+ Collection of useful modules and representations for managing DCA output data.
+
+## Major Sections
+### Representations
+  * Use Pairs to load lists, tuples, sets, and ndarrays with the correct orientation of elements. This will allow you to yield integer pairs that can be mirrored (where y becomes x and vice versa) and to subset various pairs.
+  * Use DirectInformationData to create 3-column structured ndarrays that can be sorted by "DI", mapped to a protein with a ResidueAlignment, and used to generate output for other programs (including UCSF Chimera)
+  * Use ResidueAlignment to generate a reference map. Indices of one sequence of characters can be linked to their corresponding indices of the other sequence of characters. The dictionaries produced, domain-to-protein and protein-to-domain, allow for forward mapping and backmapping.
+  * Use StructureInformation to find contacts in a protein structure and find atomic information related to specific pairs of interest.
+### Analytics
+  * Use MSATools to load in Multiple Sequence Alignment (MSA) data and provide functionality including generating frequency statistics on "gappiness" in the MSA and filtering and cleaning MSAs.
+
+
+## Diagram of Hidden Markov Machine & Direct Coupling Analysis Pipeline
+<p align="center">
+  <img src="https://github.com/user-attachments/assets/4768e08f-d513-4dbf-abc5-c80c1b3d42aa"/>
+</p>

{dcatoolkit-0.1.5 → dcatoolkit-0.1.7}/pyproject.toml

@@ -1,54 +1,54 @@
-[build-system]
-requires = ["setuptools >= 61.0"]
-build-backend = "setuptools.build_meta"
-
-[project]
-name = "dcatoolkit"
-version = "0.1.5"
-description = "Collection of useful modules and representations for managing DCA output data."
-keywords = ["dca", "toolkit", "DI", "coevolution"]
-
-readme = "README.md"
-license = {file = "LICENSE"}
-
-requires-python = ">=3.10"
-
-authors = [
-  {name = "Raheel Syed Ahmed", email = "raheelsyedahmed@gmail.com"}
-]
-maintainers = [
-  {name = "Raheel Syed Ahmed", email = "raheelsyedahmed@gmail.com"}
-]
-
-dependencies = [
-  "biotite",
-  "matplotlib>=3.8.0",
-  "numpy>=1.26.0",
-  "pandas>=2.1.0",
-  "scikit-learn>=1.3",
-  "scipy>=1.11.0",
-]
-
-classifiers = [
-  "Development Status :: 4 - Beta",
-  "Intended Audience :: Science/Research",
-  "Topic :: Scientific/Engineering :: Bio-Informatics",
-  "License :: OSI Approved :: MIT License",
-  "Programming Language :: Python :: 3",
-  "Programming Language :: Python :: 3.10",
-  "Programming Language :: Python :: 3.11",
-  "Programming Language :: Python :: 3.12",
-]
-
-[project.optional-dependencies]
-tests = [
-  "pytest",
-]
-docs = [
-  "sphinx",
-  "pdoc",
-  "numpydoc"
-]
-lint = [
-  "ruffle",
+[build-system]
+requires = ["setuptools >= 61.0"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "dcatoolkit"
+version = "0.1.7"
+description = "Collection of useful modules and representations for managing DCA output data."
+keywords = ["dca", "toolkit", "DI", "coevolution"]
+
+readme = "README.md"
+license = {file = "LICENSE"}
+
+requires-python = ">=3.10"
+
+authors = [
+  {name = "Raheel Syed Ahmed", email = "raheelsyedahmed@gmail.com"}
+]
+maintainers = [
+  {name = "Raheel Syed Ahmed", email = "raheelsyedahmed@gmail.com"}
+]
+
+dependencies = [
+  "biotite",
+  "matplotlib>=3.8.0",
+  "numpy>=1.26.0",
+  "pandas>=2.1.0",
+  "scikit-learn>=1.3",
+  "scipy>=1.11.0",
+]
+
+classifiers = [
+  "Development Status :: 4 - Beta",
+  "Intended Audience :: Science/Research",
+  "Topic :: Scientific/Engineering :: Bio-Informatics",
+  "License :: OSI Approved :: MIT License",
+  "Programming Language :: Python :: 3",
+  "Programming Language :: Python :: 3.10",
+  "Programming Language :: Python :: 3.11",
+  "Programming Language :: Python :: 3.12",
+]
+
+[project.optional-dependencies]
+tests = [
+  "pytest",
+]
+docs = [
+  "sphinx",
+  "pdoc",
+  "numpydoc"
+]
+lint = [
+  "ruffle",
 ]

{dcatoolkit-0.1.5 → dcatoolkit-0.1.7}/setup.cfg

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

{dcatoolkit-0.1.5 → dcatoolkit-0.1.7}/src/dcatoolkit/__init__.py

@@ -1,4 +1,4 @@
-
-__version__ = "0.1.5"
-from .representation import Pairs, DirectInformationData, StructureInformation, ResidueAlignment
+
+__version__ = "0.1.7"
+from .representation import Pairs, DirectInformationData, StructureInformation, ResidueAlignment
 from .analytics import MSATools

{dcatoolkit-0.1.5 → dcatoolkit-0.1.7}/src/dcatoolkit/analytics.py

@@ -1,145 +1,160 @@
-import re
-from collections import Counter
-from typing import Optional
-import string
-
-class MSATools:
-    """
-    Tools and interface for encapsulating MSA data and providing functionality for filtering and analysis.
-
-    Parameters
-    ----------
-    MSA : list of tuple of str, str
-        Loaded MSA that is a list of tuples where the first element is the header and the second element is its corresponding sequence.
-    """
-    def __init__(self, MSA: list[tuple[str, str]]):
-        self.MSA = MSA
-    
-    @staticmethod
-    def load_from_file(msa_filepath: str) -> 'MSATools':
-        """
-        Generates MSATools object from an MSA file in ".afa" format.
-
-        Parameters
-        ----------
-        msa_filepath : str
-            Filepath of the MSA in ".afa" format that is provided.
-        
-        Returns
-        -------
-        MSATools
-            An MSATools instance with the appropriate list of (header, sequence) tuples where sequences are simplified and converted to single line format.
-        """
-        msa_entries: list[tuple[str, str]] = []
-        with open(msa_filepath, 'r') as fs:
-            data = fs.read()
-        split_data = data.split(">")[1:]
-        for entry in split_data:
-            line_split_entry = entry.split("\n")
-            header = line_split_entry[0]
-            sequence = "".join(line_split_entry[1:])
-            msa_entries.append((">"+header, sequence))
-        return MSATools(msa_entries)
-
-    @staticmethod
-    def get_sequence_max_cont_gaps(sequence: str) -> int:
-        """
-        Find maximum number of continuous gaps in a specific sequence.
-
-        Parameters
-        ----------
-        sequence : str
-            Sequence of characters, potentially containing multiple of '-', a gap character.
-        
-        Returns
-        -------
-        int
-            The maximum number of continuous gaps in a sequence.
-        """
-        dash_match = re.findall(r"-+", sequence)
-        gap_counts = [len(match) for match in dash_match]
-        if len(gap_counts) > 0:
-            return max(gap_counts)
-        else:
-            return 0
-    
-    def gap_frequency(self) -> tuple[dict[int, int], dict[int, float]]:
-        """
-        Calculates the frequency of maximum continuous gaps throughout the MSA where the key corresponds to the number of continous gaps and the value corresponds to the number of sequences or the cumulative percentage of their sequences.
-
-        Returns
-        -------
-        tuple of dict of int, int and dict of int, int
-            Two element tuple where first element is a frequency count dictionary and the second element is a cumulative percentage of sequences with a specific maximum number of continous gaps.
-        """
-        max_gap_counts = []
-        for header, sequence in self.MSA:
-            max_gap_counts.append(MSATools.get_sequence_max_cont_gaps(sequence))
-        frequency_count_dict = dict(Counter(max_gap_counts))
-        cumul_perc_dict = {}
-        cumul_count = 0
-        for key in sorted(frequency_count_dict.keys()):
-            value = frequency_count_dict[key]
-            cumul_count += value
-            cumul_perc_dict[key] = cumul_count / len(self.MSA)
-        return (frequency_count_dict, cumul_perc_dict)
-    
-    def filter_by_continuous_gaps(self, max_gaps: Optional[int]=None) -> list[tuple[str, str]]:
-        """
-        Filter out entries in your MSA by the number of maximum continuous gaps specified unless None is provided. Also, removes .s and lowercase letters from the sequence.
-
-        Parameters
-        ----------
-        max_gaps : int
-            The maximum allowed number of continuous gaps in a sequence
-
-        Returns
-        -------
-        list of tuple of str, str
-            List of entries that are valid in that their sequences' number of maximum continuous gaps is within the threshold supplied as `max_gaps`. 
-        """
-        table = str.maketrans('', '', string.ascii_lowercase+".")
-        if max_gaps == None:
-            kept_entries = []
-            for header, sequence in self.MSA:
-                sequence = sequence.translate(table)
-                kept_entries.append((header, sequence))
-            return kept_entries
-        else:
-            kept_entries = []
-            for header, sequence in self.MSA:
-                sequence = sequence.translate(table)
-                if MSATools.get_sequence_max_cont_gaps(sequence) <= max_gaps:
-                    kept_entries.append((header, sequence))
-        return kept_entries
-
-    def write(self, filepath: str) -> None:
-        """
-        Writes this MSA's headers and sequences to the filepath specified.
-        
-        Parameters
-        ----------
-        filepath : str
-            Filepath to write the MSA supplied to.
-
-        Returns
-        -------
-        None
-        """
-        with open(filepath, 'w') as fs:
-            for header, sequence in self.MSA:
-                fs.write(header)
-                fs.write("\n")
-                fs.write(sequence)
-                fs.write("\n")
-
-    def __len__(self):
-        """
-        Returns the number of sequences, and equivalently, the number of headers in the MSA.
-
-        Returns
-        -------
-        int
-            length of the MSA list of header, sequence tuples.
-        """
+import re
+from collections import Counter
+from typing import Optional, Union
+import string, io
+
+class MSATools:
+    """
+    Tools and interface for encapsulating MSA data and providing functionality for filtering and analysis.
+
+    Parameters
+    ----------
+    MSA : list of tuple of str, str
+        Loaded MSA that is a list of tuples where the first element is the header and the second element is its corresponding sequence.
+    """
+    def __init__(self, MSA: list[tuple[str, str]]):
+        self.MSA = MSA
+    
+    @staticmethod
+    def load_from_file(msa_source: Union[str, io.IOBase]) -> 'MSATools':
+        """
+        Generates MSATools object from an MSA file in ".afa" format.
+
+        Parameters
+        ----------
+        msa_source : str or io.IOBase
+            Filepath or IOBase of the MSA in ".afa" format that is provided.
+        
+        Returns
+        -------
+        MSATools
+            An MSATools instance with the appropriate list of (header, sequence) tuples where sequences are simplified and converted to single line format.
+        """
+        data = ""
+        msa_entries: list[tuple[str, str]] = []
+        if isinstance(msa_source, str):
+            with open(msa_source, 'r') as fs:
+                data = fs.read()
+        elif isinstance(msa_source, io.BytesIO):
+            data = msa_source.getvalue().decode()
+        elif isinstance(msa_source, io.StringIO):
+            data = msa_source.getvalue()
+        else:
+            raise Exception("msa_file is not bytesIO, stringIO, or a filepath.")
+        split_data = data.split(">")[1:]
+        for entry in split_data:
+            line_split_entry = entry.split("\n")
+            header = line_split_entry[0]
+            sequence = "".join(line_split_entry[1:])
+            msa_entries.append((">"+header, sequence))
+        return MSATools(msa_entries)
+
+    @staticmethod
+    def get_sequence_max_cont_gaps(sequence: str) -> int:
+        """
+        Find maximum number of continuous gaps in a specific sequence.
+
+        Parameters
+        ----------
+        sequence : str
+            Sequence of characters, potentially containing multiple of '-', a gap character.
+        
+        Returns
+        -------
+        int
+            The maximum number of continuous gaps in a sequence.
+        """
+        dash_match = re.findall(r"-+", sequence)
+        gap_counts = [len(match) for match in dash_match]
+        if len(gap_counts) > 0:
+            return max(gap_counts)
+        else:
+            return 0
+    
+    def gap_frequency(self) -> tuple[dict[int, int], dict[int, float]]:
+        """
+        Calculates the frequency of maximum continuous gaps throughout the MSA where the key corresponds to the number of continous gaps and the value corresponds to the number of sequences or the cumulative percentage of their sequences.
+
+        Returns
+        -------
+        tuple of dict of int, int and dict of int, int
+            Two element tuple where first element is a frequency count dictionary and the second element is a cumulative percentage of sequences with a specific maximum number of continous gaps.
+        """
+        max_gap_counts = []
+        for header, sequence in self.MSA:
+            max_gap_counts.append(MSATools.get_sequence_max_cont_gaps(sequence))
+        frequency_count_dict = dict(Counter(max_gap_counts))
+        cumul_perc_dict = {}
+        cumul_count = 0
+        for key in sorted(frequency_count_dict.keys()):
+            value = frequency_count_dict[key]
+            cumul_count += value
+            cumul_perc_dict[key] = cumul_count / len(self.MSA)
+        return (frequency_count_dict, cumul_perc_dict)
+    
+    def filter_by_continuous_gaps(self, max_gaps: Optional[int]=None) -> list[tuple[str, str]]:
+        """
+        Filter out entries in your MSA by the number of maximum continuous gaps specified unless None is provided. Also, removes .s and lowercase letters from the sequence.
+
+        Parameters
+        ----------
+        max_gaps : int
+            The maximum allowed number of continuous gaps in a sequence
+
+        Returns
+        -------
+        list of tuple of str, str
+            List of entries that are valid in that their sequences' number of maximum continuous gaps is within the threshold supplied as `max_gaps`. 
+        """
+        table = str.maketrans('', '', string.ascii_lowercase+".")
+        if max_gaps == None:
+            kept_entries = []
+            for header, sequence in self.MSA:
+                sequence = sequence.translate(table)
+                kept_entries.append((header, sequence))
+            return kept_entries
+        else:
+            kept_entries = []
+            for header, sequence in self.MSA:
+                sequence = sequence.translate(table)
+                if MSATools.get_sequence_max_cont_gaps(sequence) <= max_gaps:
+                    kept_entries.append((header, sequence))
+        return kept_entries
+
+    def write(self, destination: Union[str, io.IOBase]) -> None:
+        """
+        Writes this MSA's headers and sequences to the destination specified.
+        
+        Parameters
+        ----------
+        destination : str or io.IOBase
+            Filepath or IO to write the MSA supplied to.
+
+        Returns
+        -------
+        None
+        """
+        if isinstance(destination, str):
+            with open(destination, 'w') as fs:
+                for header, sequence in self.MSA:
+                    fs.write(header)
+                    fs.write("\n")
+                    fs.write(sequence)
+                    fs.write("\n")
+        elif isinstance(destination, io.IOBase):
+            for header, sequence in self.MSA:
+                destination.write(header)
+                destination.write("\n")
+                destination.write(sequence)
+                destination.write("\n")
+
+    def __len__(self):
+        """
+        Returns the number of sequences, and equivalently, the number of headers in the MSA.
+
+        Returns
+        -------
+        int
+            length of the MSA list of header, sequence tuples.
+        """
         return len(self.MSA)