Boyer-Moore Algorithm

24 Sep 2023 in Study / Rosalind on Motifs

For searching motifs in suggested sequences

We should find the patterns which are represented in the suggested sequences
There are various methods for it
Boyer-Moore algorithm is efficient for searching patterns in string
It should use two methods simultaneously
- Bad-character rule (BCR)
- Good suffix rule (GSR)
It efficiently decreases the searching path in comparison to Brute-force algorithm

KDEL Visualization

09 Sep 2023 in Project on Project

Model for relationship between ER Chaperone and KDEL Receptor

ER Chaperone - KDEL Receptor 사이의 관계를 시각화한다.

06 Aug 2023 in Study / Computer science on Segment_tree

Data Structure

When it comes to an array, segment tree is used for solving sum, multiply, minimum, and maximum of the sliced array
O(logN)
The size of tree
- If the size of the array is 10, 16 is the closest to 10 in N² (> 10)
- 16 “x 2” = 32
- Consequently, 32 is the number of data needed for making the tree
- Generally, we just set the size by N “x 4”
Index of segment tree starts from 1
Left node’s value : start (root) ~ mid (root)
Right node’s value : mid + 1 ~ end (root)
Example : a = [1, 2, 3, 4, 5, 6, 7]
- Sum