File: __init__.py

package info (click to toggle)
python-biopython 1.42-2
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 17,584 kB
  • ctags: 12,272
  • sloc: python: 80,461; xml: 13,834; ansic: 7,902; cpp: 1,855; sql: 1,144; makefile: 203
file content (288 lines) | stat: -rw-r--r-- 8,604 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
# Copyright 2002 by Katharine Lindner.  All rights reserved.
# This code is part of the Biopython distribution and governed by its
# license.  Please see the LICENSE file that should have been included
# as part of this package.

"""
Hetero, Crystal and Chain exist to represent the NDB Atlas structure.  Atlas is a minimal
subset of the PDB format.  Heteo supports a 3 alphameric code.
The NDB web interface is located at http://ndbserver.rutgers.edu/NDB/index.html
"""


import string, array, copy
from Bio.Seq import Seq
from Bio.Seq import MutableSeq

def wrap_line( line ):
    output = ''
    for i in range( 0, len( line ), 80 ):
        output = output + '%s\n' % line[ i: i + 80 ]
    return output

def validate_key( key ):
    if( type( key ) != type( '' ) ):
        raise CrystalError( 'chain requires a string label' )
    if( len( key ) != 1 ):
        raise CrystalError( 'chain label should contain one letter' )

class Error( Exception ):
    """
    """
    def __init__( self ):
        pass

class CrystalError( Error ):

    """
        message - description of error
    """

    def __init__( self, message ):
        self.message = message

class Hetero:
    """
    This class exists to support the PDB hetero codes.  Supports only the 3 alphameric code.
    The annotation is available from http://alpha2.bmc.uu.se/hicup/
    """
    def __init__(self, data):
        # Enforce string storage
        if( type(data) != type("") ):
            raise CrystalError( 'Hetero data must be an alphameric string' )
        if( data.isalnum() == 0 ):
            raise CrystalError( 'Hetero data must be an alphameric string' )
        if( len( data ) > 3 ):
            raise CrystalError( 'Hetero data may contain up to 3 characters' )
        if( len( data ) < 1 ):
            raise CrystalError( 'Hetero data must not be empty' )

        self.data = data[:].lower()

    def __eq__(self, other):
        return (self.data == other.data )


    def __ne__(self, other):
        """Returns true iff self is not equal to other."""
        return not self.__eq__(other)

    def __repr__(self):
        return "%s" % self.data

    def __str__(self):
        return "%s" % self.data


    def __len__(self): return len(self.data)

class Chain:
    def __init__(self, residues = '' ):
        self.data = []
        if( type( residues ) == type( '' ) ):
            residues = residues.replace( '*', ' ' )
            residues = residues.strip()
            elements = residues.split()
            self.data = map( Hetero, elements )
        elif( type( residues ) == type( [] ) ):
            for element in residues:
                if( not isinstance( element, Hetero ) ):
                    raise CrystalError( 'Text must be a string' )
            for residue in residues:
                self.data.append( residue )
        elif( isinstance( residues, Chain ) ):
            for residue in residues:
                self.data.append( residue )
        self.validate()

    def validate( self ):
        data = self.data
        for element in data:
            self.validate_element( element )

    def validate_element( self, element ):
        if(  not isinstance( element, Hetero ) ):
            raise TypeError

    def __str__( self ):
        output = ''
        i = 0
        for element in self.data:
            output = output + '%s ' % element
        output = output.strip()
        output = wrap_line( output )
        return output


    def __eq__(self, other):
        if( len( self.data ) != len( other.data ) ):
            return 0
        ok = reduce( lambda x, y: x and y, map( lambda x, y: x == y, self.data, other.data ) )
        return ok

    def __ne__(self, other):
        """Returns true iff self is not equal to other."""
        return not self.__eq__(other)

    def __len__(self): return len(self.data)
    def __getitem__(self, i): return self.data[i]

    def __setitem__(self, i, item):
        try:
            self.validate_element( item )
        except TypeError:
            item = Hetero( item.lower() )
        self.data[i] = item

    def __delitem__(self, i):
        del self.data[i]

    def __getslice__(self, i, j):
        i = max(i, 0); j = max(j, 0)
        return self.__class__(self.data[i:j])

    def __setslice__(self, i, j, other):
        i = max(i, 0); j = max(j, 0)
        if isinstance(other, Chain):
            self.data[i:j] = other.data
        elif isinstance(other, type(self.data)):
            self.data[i:j] = other
        elif type( other ) == type( '' ):
            self.data[ i:j ] = Chain( other ).data
        else:
            raise TypeError

    def __delslice__(self, i, j):
        i = max(i, 0); j = max(j, 0)
        del self.data[i:j]

    def __contains__(self, item):
        try:
            self.validate_element( item )
        except TypeError:
            item = Hetero( item.lower() )
        return item in self.data

    def append(self, item):
        try:
            self.validate_element( item )
        except TypeError:
            item = Hetero( item.lower() )
        self.data.append(item)

    def insert(self, i, item):
        try:
            self.validate_element( item )
        except TypeError:
            item = Hetero( item.lower() )
        self.data.insert(i, item)

    def remove(self, item):
        item = Hetero( item.lower() )
        self.data.remove(item)

    def count(self, item):
        try:
            self.validate_element( item )
        except TypeError:
            item = Hetero( item.lower() )
        return self.data.count(item)

    def index(self, item):
        try:
            self.validate_element( item )
        except TypeError:
            item = Hetero( item.lower() )
        return self.data.index(item)

    def __add__(self, other):
        if isinstance(other, Chain):
            return self.__class__(self.data + other.data)
        elif type( other ) == type( '' ):
            return self.__class__(self.data + Chain( other).data )
        else:
            raise TypeError

    def __radd__(self, other):
        if isinstance(other, Chain):
            return self.__class__( other.data + self.data )
        elif type( other ) == type( '' ):
            return self.__class__( Chain( other ).data + self.data )
        else:
            raise TypeError

    def __iadd__(self, other):
        if isinstance(other, Chain ):
            self.data += other.data
        elif type( other ) == type( '' ):
            self.data += Chain( other ).data
        else:
            raise TypeError
        return self

class Crystal:
    def __init__(self, data = {} ):
        # Enforcestorage
        if( type( data ) != type( {} ) ):
            raise CrystalError( 'Crystal must be a dictionary' )
        self.data = data
        self.fix()

    def fix( self ):
        data = self.data
        for key in data.keys():
            element = data[ key ]
            if( isinstance( element, Chain ) ):
                pass
            elif type( element ) == type( '' ):
                data[ key ] = Chain( element )
            else:
                raise TypeError



    def __repr__(self):
        output = ''
        keys = self.data.keys()
        keys.sort()
        for key in keys:
            output = output +  '%s : %s\n' % ( key, self.data[ key ] )
        return output

    def __str__(self):
        output = ''
        keys = self.data.keys()
        keys.sort()
        for key in keys:
            output = output +  '%s : %s\n' % ( key, self.data[ key ] )
        return output

    def tostring(self):
        return self.data

    def __len__(self): return len(self.data)
    def __getitem__(self, key): return self.data[key]
    def __setitem__(self, key, item):
        if isinstance( item, Chain ):
            self.data[key] = item
        elif type( item ) == type( '' ):
            self.data[ key ] = Chain( item )
        else:
            raise TypeError

    def __delitem__(self, key): del self.data[key]
    def clear(self): self.data.clear()
    def copy(self):
        return copy.copy(self)
    def keys(self): return self.data.keys()
    def items(self): return self.data.items()
    def values(self): return self.data.values()
    def has_key(self, key): return self.data.has_key(key)
    def get(self, key, failobj=None):
        return self.data.get(key, failobj)
    def setdefault(self, key, failobj=None):
        if not self.data.has_key(key):
            self.data[key] = failobj
        return self.data[key]
    def popitem(self):
        return self.data.popitem()