Документ взят из кэша поисковой машины. Адрес оригинального документа : http://kodomo.fbb.msu.ru/hg/allpy/annotate/21c2358cb5e7/allpy/base.py
Дата изменения: Unknown
Дата индексирования: Sun Mar 2 07:05:23 2014
Кодировка:
allpy: allpy/base.py annotate

allpy

annotate allpy/base.py @ 299:21c2358cb5e7

Implemented allpy.base.Alignment row/column model: methods rows(), *_as_lists()
author Daniil Alexeyevsky <me.dendik@gmail.com>
date Thu, 16 Dec 2010 18:51:05 +0300
parents c305a80cdb75
children 5d355141f37d
rev   line source
me@261 1 import sys
me@261 2 import os
me@262 3 import os.path
me@261 4 from tempfile import NamedTemporaryFile
me@262 5 import urllib2
me@261 6
me@261 7 import config
me@284 8 import fasta
me@261 9 from graph import Graph
me@262 10 from Bio.PDB.DSSP import make_dssp_dict
me@260 11 import data.codes
me@260 12
me@260 13 class MonomerType(object):
me@260 14 """Class of monomer types.
me@260 15
me@260 16 Each MonomerType object represents a known monomer type, e.g. Valine,
me@260 17 and is referenced to by each instance of monomer in a given sequence.
me@260 18
me@260 19 - `name`: full name of monomer type
me@260 20 - `code1`: one-letter code
me@260 21 - `code3`: three-letter code
me@260 22 - `is_modified`: either of True or False
me@260 23
me@260 24 class atributes:
me@260 25
me@260 26 - `by_code1`: a mapping from one-letter code to MonomerType object
me@260 27 - `by_code3`: a mapping from three-letter code to MonomerType object
me@260 28 - `by_name`: a mapping from monomer name to MonomerType object
me@260 29 - `instance_type`: class of Monomer objects to use when creating new
me@260 30 objects; this must be redefined in descendent classes
me@260 31
me@260 32 All of the class attributes MUST be redefined when subclassing.
me@260 33 """
me@260 34
me@260 35 by_code1 = {}
me@260 36 by_code3 = {}
me@260 37 by_name = {}
me@260 38 instance_type = None
me@260 39
me@260 40 def __init__(self, name="", code1="", code3="", is_modified=False):
me@260 41 self.name = name.capitalize()
me@260 42 self.code1 = code1.upper()
me@260 43 self.code3 = code3.upper()
me@260 44 self.is_modified = bool(is_modified)
me@260 45 if not is_modified:
me@260 46 self.by_code1[self.code1] = self
me@260 47 self.by_code3[code3] = self
me@260 48 self.by_name[name] = self
me@260 49 # We duplicate distinguished long names into MonomerType itself,
me@260 50 # so that we can use MonomerType.from_code3 to create the relevant
me@260 51 # type of monomer.
me@260 52 MonomerType.by_code3[code3] = self
me@260 53 MonomerType.by_name[name] = self
me@260 54
me@260 55 @classmethod
me@260 56 def _initialize(cls, type_letter, codes=data.codes.codes):
me@260 57 """Create all relevant instances of MonomerType.
me@260 58
me@260 59 `type_letter` is either of:
me@260 60
me@260 61 - 'p' for protein
me@260 62 - 'd' for DNA
me@260 63 - 'r' for RNA
me@260 64
me@260 65 `codes` is a table of monomer codes
me@260 66 """
me@260 67 for type, code1, is_modified, code3, name in codes:
me@260 68 if type == type_letter:
me@260 69 cls(name, code1, code3, is_modified)
me@260 70
me@260 71 @classmethod
me@260 72 def from_code1(cls, code1):
me@260 73 """Return monomer type by one-letter code."""
me@260 74 return cls.by_code1[code1.upper()]
me@260 75
me@260 76 @classmethod
me@260 77 def from_code3(cls, code3):
me@260 78 """Return monomer type by three-letter code."""
me@260 79 return cls.by_code3[code3.upper()]
me@260 80
me@260 81 @classmethod
me@260 82 def from_name(cls, name):
me@260 83 """Return monomer type by name."""
me@260 84 return cls.by_name[name.capitalize()]
me@260 85
me@260 86 def instance(self):
me@260 87 """Create a new monomer of given type."""
me@260 88 return self.instance_type(self)
me@260 89
me@260 90 def __eq__(self, other):
me@260 91 if hasattr(other, "type"):
me@260 92 return self is other.type
me@260 93 return self is other
me@260 94
me@260 95 class Monomer(object):
me@260 96 """Monomer object.
me@260 97
me@260 98 attributes:
me@260 99
me@260 100 - `type`: type of monomer (a MonomerType object)
me@260 101
me@282 102 class attributes:
me@282 103
me@282 104 - `monomer_type`: either MonomerType or one of it's subclasses, it is used
me@282 105 when creating new monomers. It SHOULD be redefined when subclassing
me@282 106 Monomer.
me@260 107 """
me@260 108 monomer_type = MonomerType
me@260 109
me@260 110 def __init__(self, type):
me@260 111 self.type = type
me@260 112
me@260 113 @classmethod
me@260 114 def from_code1(cls, code1):
me@260 115 return cls(cls.monomer_type.by_code1[code1.upper()])
me@260 116
me@260 117 @classmethod
me@260 118 def from_code3(cls, code3):
me@260 119 return cls(cls.monomer_type.by_code3[code3.upper()])
me@260 120
me@260 121 @classmethod
me@260 122 def from_name(cls, name):
me@260 123 return cls(cls.monomer_type.by_name[name.capitalize()])
me@260 124
me@260 125 def __eq__(self, other):
me@260 126 if hasattr(other, "type"):
me@260 127 return self.type is other.type
me@260 128 return self.type is other
bnagaev@239 129
bnagaev@239 130 class Sequence(list):
me@274 131 """Sequence of Monomers.
bnagaev@243 132
me@274 133 This behaves like list of monomer objects. In addition to standard list
me@274 134 behaviour, Sequence has the following attributes:
me@270 135
me@274 136 * name -- str with the name of the sequence
me@274 137 * description -- str with description of the sequence
me@274 138 * source -- str denoting source of the sequence
me@266 139
me@274 140 Any of them may be empty (i.e. hold empty string)
me@275 141
me@275 142 Class attributes:
me@282 143
me@275 144 * monomer_type -- type of monomers in sequence, must be redefined when
me@275 145 subclassing
me@274 146 """
me@270 147
me@275 148 monomer_type = Monomer
me@270 149
me@275 150 name = ''
me@275 151 description = ''
me@275 152 source = ''
me@275 153
me@275 154 def __init__(self, sequence=[], name=None, description=None, source=None):
me@275 155 super(Sequence, self).__init__(sequence)
me@275 156 if hasattr(sequence, 'name'):
me@275 157 vars(self).update(vars(sequence))
me@275 158 if name:
me@275 159 self.name = name
me@275 160 if description:
me@275 161 self.description = description
me@275 162 if source:
me@275 163 self.source = source
me@270 164
me@262 165 def __str__(self):
me@275 166 """Returns sequence in one-letter code."""
me@275 167 return ''.join(monomer.code1 for monomer in self)
me@270 168
me@273 169 @classmethod
me@273 170 def from_string(cls, string, name='', description=''):
me@273 171 """Create sequences from string of one-letter codes."""
me@273 172 monomer = cls.monomer_type.from_code1
me@273 173 monomers = [monomer(letter) for letter in string]
me@273 174 return cls(monomers, name, description)
me@262 175
me@284 176 @classmethod
me@284 177 def from_fasta(cls, file):
me@284 178 """Read sequence from FASTA file.
me@286 179
me@284 180 File must contain exactly one sequence.
me@284 181 """
me@284 182 sequences = fasta.parse_file(file)
me@284 183 assert len(sequences) == 1
me@287 184 name, description = sequences.keys()[0]
me@284 185 return cls(sequences[header], name, description, file.name)
me@284 186
me@295 187 class Alignment(object):
me@295 188 """Alignment. It is a list of Columns."""
bnagaev@249 189
me@287 190 sequence_type = Sequence
me@289 191 """Type of sequences in alignment. SHOULD be redefined when subclassing."""
me@288 192
me@289 193 sequences = None
me@289 194 """Ordered list of sequences in alignment. Read, but DO NOT FIDDLE!"""
bnagaev@249 195
me@287 196 def __init__(self):
me@287 197 """Initialize empty alignment."""
me@287 198 super(Alignment, self).__init__()
me@287 199 self.sequences = []
me@295 200 self.columns = []
me@282 201
me@299 202 # Alignment modification methods
me@299 203 # ==============================
me@299 204
me@294 205 def append_sequence(self, sequence):
me@294 206 """Add sequence to alignment.
me@294 207
me@294 208 If sequence is too short, pad it with gaps on the right.
me@294 209 """
me@294 210 self.sequences.append(sequence)
me@294 211 for i, monomer in enumerate(sequence):
me@295 212 self.columns[i][sequence] = monomer
me@294 213
me@294 214 def append_gapped_line(self, line, name='', description='', source=''):
me@287 215 """Add row from a line of one-letter codes and gaps."""
me@287 216 Sequence = cls.sequence_type
me@287 217 not_gap = lambda (i, char): char != "-"
me@287 218 no_gaps = line.replace("-", "")
me@287 219 sequence = Sequence(no_gaps, name, description, source)
me@287 220 for i, (j, char) in enumerate(filter(not_gap, enumerate(line))):
me@295 221 self.columns[j][seq] = sequence[i]
me@287 222 self.sequences.append(sequence)
me@287 223
me@299 224 # Alignment IO methods
me@299 225 # ====================
me@299 226
me@287 227 @classmethod
me@287 228 def from_fasta(cls, file):
me@287 229 """Create new alignment from FASTA file."""
me@287 230 self = cls()
me@287 231 for ((name, description), body) in fasta.parse_file(file):
me@294 232 self.append_gapped_line(body, name, description)
me@287 233 return self
bnagaev@249 234
me@292 235 def to_fasta(self, file):
me@292 236 """Write alignment in FASTA file as sequences with gaps."""
me@292 237 def char(monomer):
me@292 238 if monomer:
me@292 239 return monomer.code1
me@292 240 return "-"
me@292 241 for row in self.rows_as_lists():
me@292 242 seq = row.sequence
me@292 243 line = "".join(map(char, row))
me@292 244 fasta.save_file(file, line, seq.name, seq.description)
me@292 245
me@299 246 # Data access methods for alignment
me@299 247 # =================================
me@299 248
me@299 249 def rows(self):
me@299 250 """Return list of rows (temporary objects) in alignment.
me@299 251
me@299 252 Each row is a dictionary of { column : monomer }.
me@299 253
me@299 254 For gap positions there is no key for the column in row.
me@299 255
me@299 256 Each row has attribute `sequence` pointing to the sequence the row is
me@299 257 describing.
me@299 258
me@299 259 Modifications of row have no effect on the alignment.
me@299 260 """
me@299 261 # For now, the function returns a list rather than iterator.
me@299 262 # It is yet to see, whether memory performance here becomes critical,
me@299 263 # or is random access useful.
me@299 264 rows = []
me@299 265 for sequence in self.sequences:
me@299 266 row = util.UserDict()
me@299 267 row.sequence = sequence
me@299 268 for column in self.columns:
me@299 269 if sequence in column:
me@299 270 row[column] = column[sequence]
me@299 271 rows.append(row)
me@299 272 return rows
me@299 273
me@299 274 def rows_as_lists(self):
me@299 275 """Return list of rows (temporary objects) in alignment.
me@299 276
me@299 277 Each row here is a list of either monomer or None (for gaps).
me@299 278
me@299 279 Each row has attribute `sequence` pointing to the sequence of row.
me@299 280
me@299 281 Modifications of row have no effect on the alignment.
me@299 282 """
me@299 283 rows = []
me@299 284 for sequence in self.sequences:
me@299 285 row = util.UserList()
me@299 286 row.sequence = sequence
me@299 287 for column in self.columns:
me@299 288 row.append(column.get(sequence))
me@299 289 rows.append(row)
me@299 290 return rows
me@299 291
me@299 292 def columns_as_lists(self):
me@299 293 """Return list of columns (temorary objects) in alignment.
me@299 294
me@299 295 Each column here is a list of either monomer or None (for gaps).
me@299 296
me@299 297 Items of column are sorted in the same way as alignment.sequences.
me@299 298
me@299 299 Modifications of column have no effect on the alignment.
me@299 300 """
me@299 301 columns = []
me@299 302 for column in self.columns:
me@299 303 col = []
me@299 304 for sequence in self.sequences:
me@299 305 col.append(column.get(sequence))
me@299 306 columns.append(col)
me@299 307 return columns
me@299 308
me@292 309 ## Unclean code follows
me@292 310
bnagaev@249 311 def length(self):
me@287 312 """Return width, ie length of each sequence with gaps."""
bnagaev@249 313 return max([len(line) for line in self.body.values()])
bnagaev@249 314
bnagaev@249 315 def height(self):
bnagaev@249 316 """ The number of sequences in alignment (it's thickness). """
bnagaev@249 317 return len(self.body)
bnagaev@249 318
bnagaev@249 319 def identity(self):
bnagaev@249 320 """ Calculate the identity of alignment positions for colouring.
bnagaev@249 321
bnagaev@249 322 For every (row, column) in alignment the percentage of the exactly
bnagaev@249 323 same residue in the same column in the alignment is calculated.
me@270 324 The data structure is just like the Alignment.body, but istead of
bnagaev@249 325 monomers it contains float percentages.
bnagaev@249 326 """
bnagaev@249 327 # Oh, God, that's awful! Absolutely not understandable.
bnagaev@249 328 # First, calculate percentages of amino acids in every column
bnagaev@249 329 contribution = 1.0 / len(self.sequences)
bnagaev@249 330 all_columns = []
bnagaev@249 331 for position in range(len(self)):
bnagaev@249 332 column_percentage = {}
bnagaev@249 333 for seq in self.body:
bnagaev@249 334 if self.body[seq][position] is not None:
bnagaev@249 335 aa = self.body[seq][position].code
bnagaev@249 336 else:
bnagaev@249 337 aa = None
bnagaev@249 338 if aa in allpy.data.amino_acids:
bnagaev@249 339 if aa in column_percentage.keys():
bnagaev@249 340 column_percentage[aa] += contribution
bnagaev@249 341 else:
bnagaev@249 342 column_percentage[aa] = contribution
bnagaev@249 343 all_columns.append(column_percentage)
bnagaev@249 344 # Second, map these percentages onto the alignment
bnagaev@249 345 self.identity_percentages = {}
bnagaev@249 346 for seq in self.sequences:
bnagaev@249 347 self.identity_percentages[seq] = []
bnagaev@249 348 for seq in self.identity_percentages:
bnagaev@249 349 line = self.identity_percentages[seq]
bnagaev@249 350 for position in range(len(self)):
bnagaev@249 351 if self.body[seq][position] is not None:
bnagaev@249 352 aa = self.body[seq][position].code
bnagaev@249 353 else:
bnagaev@249 354 aa = None
bnagaev@249 355 line.append(all_columns[position].get(aa))
bnagaev@249 356 return self.identity_percentages
bnagaev@249 357
bnagaev@249 358 class Block(object):
me@261 359 """ Block of alignment
me@270 360
me@261 361 Mandatory data:
me@266 362
me@261 363 * self.alignment -- alignment object, which the block belongs to
me@261 364 * self.sequences - set of sequence objects that contain monomers
me@261 365 and/or gaps, that constitute the block
me@261 366 * self.positions -- list of positions of the alignment.body that
me@261 367 are included in the block; position[i+1] is always to the right from position[i]
me@270 368
me@261 369 Don't change self.sequences -- it may be a link to other block.sequences
me@270 370
me@261 371 How to create a new block:
me@282 372
me@261 373 >>> import alignment
me@261 374 >>> import block
me@261 375 >>> proj = alignment.Alignment(open("test.fasta"))
me@261 376 >>> block1 = block.Block(proj)
me@261 377 """
me@270 378
me@261 379 def __init__(self, alignment, sequences=None, positions=None):
me@261 380 """ Builds new block from alignment
me@270 381
me@261 382 if sequences==None, all sequences are used
me@261 383 if positions==None, all positions are used
me@261 384 """
me@261 385 if sequences == None:
me@261 386 sequences = set(alignment.sequences) # copy
me@261 387 if positions == None:
me@261 388 positions = range(len(alignment))
me@261 389 self.alignment = alignment
me@261 390 self.sequences = sequences
me@261 391 self.positions = positions
me@270 392
me@261 393 def save_fasta(self, out_file, long_line=70, gap='-'):
me@270 394 """ Saves alignment to given file in fasta-format
me@270 395
me@261 396 No changes in the names, descriptions or order of the sequences
me@261 397 are made.
me@261 398 """
me@261 399 for sequence in self.sequences:
me@261 400 alignment_monomers = self.alignment.body[sequence]
me@261 401 block_monomers = [alignment_monomers[i] for i in self.positions]
me@261 402 string = ''.join([m.type.code1 if m else '-' for m in block_monomers])
me@261 403 save_fasta(out_file, string, sequence.name, sequence.description, long_line)
me@270 404
me@270 405 def geometrical_cores(self, max_delta=config.delta,
me@270 406 timeout=config.timeout, minsize=config.minsize,
me@261 407 ac_new_atoms=config.ac_new_atoms,
me@261 408 ac_count=config.ac_count):
me@261 409 """ Returns length-sorted list of blocks, representing GCs
me@270 410
me@282 411 * max_delta -- threshold of distance spreading
me@282 412 * timeout -- Bron-Kerbosh timeout (then fast O(n ln n) algorithm)
me@282 413 * minsize -- min size of each core
me@282 414 * ac_new_atoms -- min part or new atoms in new alternative core
me@282 415 current GC is compared with each of already selected GCs if
me@282 416 difference is less then ac_new_atoms, current GC is skipped
me@261 417 difference = part of new atoms in current core
me@282 418 * ac_count -- max number of cores (including main core)
me@261 419 -1 means infinity
me@282 420
me@261 421 If more than one pdb chain for some sequence provided, consider all of them
me@270 422 cost is calculated as 1 / (delta + 1)
me@282 423
me@261 424 delta in [0, +inf) => cost in (0, 1]
me@261 425 """
me@261 426 nodes = self.positions
me@261 427 lines = {}
me@261 428 for i in self.positions:
me@261 429 for j in self.positions:
me@261 430 if i < j:
me@261 431 distances = []
me@261 432 for sequence in self.sequences:
me@261 433 for chain in sequence.pdb_chains:
me@261 434 m1 = self.alignment.body[sequence][i]
me@261 435 m2 = self.alignment.body[sequence][j]
me@261 436 if m1 and m2:
me@261 437 r1 = sequence.pdb_residues[chain][m1]
me@261 438 r2 = sequence.pdb_residues[chain][m2]
me@261 439 ca1 = r1['CA']
me@261 440 ca2 = r2['CA']
me@261 441 d = ca1 - ca2 # Bio.PDB feature
me@261 442 distances.append(d)
me@261 443 if len(distances) >= 2:
me@261 444 delta = max(distances) - min(distances)
me@261 445 if delta <= max_delta:
me@261 446 lines[Graph.line(i, j)] = 1.0 / (1.0 + max_delta)
me@261 447 graph = Graph(nodes, lines)
me@261 448 cliques = graph.cliques(timeout=timeout, minsize=minsize)
me@261 449 GCs = []
me@261 450 for clique in cliques:
me@261 451 for GC in GCs:
me@261 452 if len(clique - set(GC.positions)) < ac_new_atoms * len(clique):
me@261 453 break
me@261 454 else:
me@261 455 GCs.append(Block(self.alignment, self.sequences, clique))
me@261 456 if ac_count != -1 and len(GCs) >= ac_count:
me@261 457 break
me@261 458 return GCs
me@270 459
me@261 460 def xstring(self, x='X', gap='-'):
me@261 461 """ Returns string consisting of gap chars and chars x at self.positions
me@270 462
me@261 463 Length of returning string = length of alignment
me@261 464 """
me@261 465 monomers = [False] * len(self.alignment)
me@261 466 for i in self.positions:
me@261 467 monomers[i] = True
me@261 468 return ''.join([x if m else gap for m in monomers])
me@270 469
me@261 470 def save_xstring(self, out_file, name, description='', x='X', gap='-', long_line=70):
me@261 471 """ Save xstring and name in fasta format """
me@261 472 save_fasta(out_file, self.xstring(x=x, gap=gap), name, description, long_line)
me@270 473
me@261 474 def monomers(self, sequence):
me@261 475 """ Iterates monomers of this sequence from this block """
me@261 476 alignment_sequence = self.alignment.body[sequence]
me@261 477 return (alignment_sequence[i] for i in self.positions)
me@270 478
me@261 479 def ca_atoms(self, sequence, pdb_chain):
me@261 480 """ Iterates Ca-atom of monomers of this sequence from this block """
me@261 481 return (sequence.pdb_residues[pdb_chain][monomer] for monomer in self.monomers())
me@270 482
me@261 483 def sequences_chains(self):
me@261 484 """ Iterates pairs (sequence, chain) """
me@261 485 for sequence in self.alignment.sequences:
me@261 486 if sequence in self.sequences:
me@261 487 for chain in sequence.pdb_chains:
me@261 488 yield (sequence, chain)
me@270 489
me@261 490 def superimpose(self):
me@261 491 """ Superimpose all pdb_chains in this block """
me@261 492 sequences_chains = list(self.sequences_chains())
me@261 493 if len(sequences_chains) >= 1:
me@261 494 sup = Superimposer()
me@261 495 fixed_sequence, fixed_chain = sequences_chains.pop()
me@261 496 fixed_atoms = self.ca_atoms(fixed_sequence, fixed_chain)
me@261 497 for sequence, chain in sequences_chains:
me@261 498 moving_atoms = self.ca_atoms(sequence, chain)
me@261 499 sup.set_atoms(fixed_atoms, moving_atoms)
me@261 500 # Apply rotation/translation to the moving atoms
me@261 501 sup.apply(moving_atoms)
me@270 502
me@261 503 def pdb_save(self, out_file):
me@270 504 """ Save all sequences
me@270 505
me@261 506 Returns {(sequence, chain): CHAIN}
me@261 507 CHAIN is chain letter in new file
me@261 508 """
me@261 509 tmp_file = NamedTemporaryFile(delete=False)
me@261 510 tmp_file.close()
me@270 511
me@261 512 for sequence, chain in self.sequences_chains():
me@261 513 sequence.pdb_save(tmp_file.name, chain)
me@261 514 # TODO: read from tmp_file.name
me@261 515 # change CHAIN
me@261 516 # add to out_file
me@270 517
me@261 518 os.unlink(NamedTemporaryFile)
bnagaev@239 519
me@260 520 # vim: set ts=4 sts=4 sw=4 et: