RNApolis 0.4.2__tar.gz → 0.4.3__tar.gz

{rnapolis-0.4.2/src/RNApolis.egg-info → rnapolis-0.4.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: RNApolis
-Version: 0.4.2
+Version: 0.4.3
 Summary: A Python library containing RNA-related bioinformatics functions and classes
 Home-page: https://github.com/tzok/rnapolis-py
 Author: Tomasz Zok

{rnapolis-0.4.2 → rnapolis-0.4.3}/setup.py

@@ -5,7 +5,7 @@ with open("README.md") as f:
 
 setup(
     name="RNApolis",
-    version="0.4.2",
+    version="0.4.3",
     packages=["rnapolis"],
     package_dir={"": "src"},
     author="Tomasz Zok",

{rnapolis-0.4.2 → rnapolis-0.4.3/src/RNApolis.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: RNApolis
-Version: 0.4.2
+Version: 0.4.3
 Summary: A Python library containing RNA-related bioinformatics functions and classes
 Home-page: https://github.com/tzok/rnapolis-py
 Author: Tomasz Zok

{rnapolis-0.4.2 → rnapolis-0.4.3}/src/rnapolis/tertiary.py

@@ -497,24 +497,27 @@ class Mapping2D3D:
 
     @cached_property
     def strands_sequences(self) -> List[Tuple[str, str]]:
-        result = defaultdict(list)
+        nucleotides = list(filter(lambda r: r.is_nucleotide, self.structure3d.residues))
 
-        for i, residue in enumerate(
-            filter(lambda r: r.is_nucleotide, self.structure3d.residues)
-        ):
-            if i > 0 and self.find_gaps:
-                previous = self.structure3d.residues[i - 1]
+        if not nucleotides:
+            return []
 
-                if (
-                    not previous.is_connected(residue)
-                    and previous.chain == residue.chain
-                ):
-                    for k in range(residue.number - previous.number - 1):
-                        result[residue.chain].append("?")
+        result = [(nucleotides[0].chain, [nucleotides[0].one_letter_name])]
+
+        for i in range(1, len(nucleotides)):
+            previous = nucleotides[i - 1]
+            residue = nucleotides[i]
 
-            result[residue.chain].append(residue.one_letter_name)
+            if residue.chain != previous.chain:
+                result.append((residue.chain, [residue.one_letter_name]))
+            else:
+                if self.find_gaps:
+                    if not previous.is_connected(residue):
+                        for k in range(residue.number - previous.number - 1):
+                            result[-1][1].append("?")
+                result[-1][1].append(residue.one_letter_name)
 
-        return [(chain, "".join(sequence)) for chain, sequence in result.items()]
+        return [(chain, "".join(sequence)) for chain, sequence in result]
 
     @cached_property
     def bpseq(self) -> BpSeq: