Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
M
MATH1222_project
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
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
Schins Martin
MATH1222_project
Commits
f6086983
Commit
f6086983
authored
2 weeks ago
by
maschins
Browse files
Options
Downloads
Patches
Plain Diff
Add readme.md
parent
5706970a
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
readme.md
+28
-0
28 additions, 0 deletions
readme.md
with
28 additions
and
0 deletions
readme.md
0 → 100644
+
28
−
0
View file @
f6086983
# MATH1222
This is a repo for the project of the course
*MATH122: Introduction aux processus stochastiques*
.
## Statement
The statement can be found
[
here
](
projet-math1222-2025.pdf
)
. This project was done in groups of two.
The objective of the project was to model the mutations of ADN.
### Complementary informations
One of the usages of phylogenetic trees is to find relations between beings.
The first thing we need to model is the evolution of the ADN.
We have a mutation when one of the nucleotide of the sequence changes over time.
We take in that the mutation is not influenced by the nucleotides and that it's without memory.
We can thus represent this with a Markov chain. We use the substitution model of Kimura.
We won't manipulate the markov chain of the whole sequence because there would be too many possibilities.
The chain is also reversible meaning the probability of doing one inversion is the same as doing the opposite.
Because we don't have the sequence of the nodes and the racine but only the leafs we need to use
$$P(s_1,
\c
dots,s_5
\|
T)=
\s
um_{s'_1, s'_2,
\c
dots} P(s_1,
\c
dots,s_5,s'_1,s'_2,
\c
dots,s'_{N-1}|T)$$
<span
style=
"color:#FF0000"
>
DEADLINE:
</span>
**09/05/2025**
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