Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
M
MIT_MAHE
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Analyze
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
2022 Competition
Software Tools
MIT_MAHE
Commits
8b3f88a6
Commit
8b3f88a6
authored
2 years ago
by
Ashrith Sagar Yedlapalli
Browse files
Options
Downloads
Patches
Plain Diff
c0.16.2
parent
7aa25acb
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
pep_mod.py
+13
-12
13 additions, 12 deletions
pep_mod.py
with
13 additions
and
12 deletions
pep_mod.py
+
13
−
12
View file @
8b3f88a6
...
...
@@ -210,27 +210,25 @@ class Mutater:
get_all_dipeptides
=
lambda
seq
:
re
.
finditer
(
r
"
(.)\1
"
,
seq
)
try
:
seq
uence
s
=
[
x
for
x
in
itertools
.
filterfalse
(
check_dipeptide
,
map
(
""
.
join
,
self
.
sequences
))]
seqs
=
[
x
for
x
in
itertools
.
filterfalse
(
check_dipeptide
,
map
(
""
.
join
,
self
.
sequences
))]
self
.
sequences_consumable
=
False
except
:
seq
uence
s
=
itertools
.
filterfalse
(
check_dipeptide
,
map
(
""
.
join
,
self
.
sequences
))
except
:
# pylint: disable=bare-except
seqs
=
itertools
.
filterfalse
(
check_dipeptide
,
map
(
""
.
join
,
self
.
sequences
))
self
.
sequences_consumable
=
True
print
(
"
S| Removed dipeptides from sequences
"
)
self
.
sequences
=
seq
uence
s
self
.
sequences
=
seqs
return
sequences
def
by_intein_sequences
(
self
):
"""
[SKIPPED]
"""
pass
def
by_cleavage_sites
(
self
):
"""
[SKIPPED]
"""
pass
# def intein_matches(sequence):
# inteins = ["CRAZY_SEQUENCE", "ANOTHER_SEQUENCE"]
# # Put the source as a dictionary or an array, preferably.
...
...
@@ -244,13 +242,11 @@ class Mutater:
def
by_charge_criterion
(
self
):
"""
[SKIPPED]
"""
pass
def
randomise
(
self
):
"""
At random positions
"""
pass
# [TODO]
# for mutation_position in range(len(sequence)):
# sequences = groups_mutations(sequence, [str(mutation_position)])
...
...
@@ -270,11 +266,15 @@ class Mutater:
seqs
=
[]
for
seq
in
map
(
""
.
join
,
self
.
sequences
):
seqs
.
append
(
seq
)
sequences
=
random
.
sample
(
seqs
,
choose
)
print
(
"
S| Sampled
"
,
choose
,
"
sequences
"
)
self
.
sequences
=
sequences
try
:
seqs
=
random
.
sample
(
seqs
,
choose
)
print
(
"
S| Sampled
"
,
choose
,
"
sequences
"
)
except
:
# pylint: disable=bare-except
pass
self
.
sequences
=
seqs
return
sequences
...
...
@@ -284,6 +284,7 @@ class Mutater:
Chooses 5 sequences by default.
"""
new_sequences
=
[]
print
(
"
S| Choosing
"
,
choose
)
# mean, var, skew, kurt = norm.stats(moments='mvsk')
# [TODO]
return
new_sequences
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment