BioHackersNet|
Size: 880
Comment:
|
Size: 868
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| '''Maximal Unique Match (er)'''. | '''Maximal Unique Match (er)'''. Large Sequence간의 효율적인 SequenceAlignment를 위해 [TIGR]에서 개발한 프로그램. http://www.tigr.org/software/mummer/ |
| Line 6: | Line 9: |
| 2. find a logest set of MUMs in the increasing order. 3. Close the gaps. 4. Output entire alignmnet. |
1. find a logest set of MUMs in the increasing order. 1. Close the gaps. 1. Output entire alignmnet. |
| Line 10: | Line 13: |
| once we got unique matches, we still need to find a set of a longest MUMs typically using LIS method ---- Large Sequence간의 효율적인 SequenceAlignment를 위해 [TIGR]에서 개발한 프로그램. |
Once we got unique matches, we still need to find a set of a longest MUMs typically using LIS method |
| Line 18: | Line 17: |
| http://www.tigr.org/software/mummer/ 관련 paper : [http://bioinfo.sarang.net/moin/wiki/upload/MUMmer.pdf] |
관련 paper * http://biohackers.net/moin/wiki/upload/MUMmer.pdf |
Maximal Unique Match (er). Large Sequence간의 효율적인 SequenceAlignment를 위해 [TIGR]에서 개발한 프로그램.
http://www.tigr.org/software/mummer/
두 유전자 배열안에는 반드시 반복되는 공통된 부분을 갖고 있다는 전제를 하고, 이 부분을 MUM이라 한다.
Approach.
- Find MUMs (suffix tree for two genome sequences).
- find a logest set of MUMs in the increasing order.
- Close the gaps.
- Output entire alignmnet.
Once we got unique matches, we still need to find a set of a longest MUMs typically using LIS method
SuffixTree를 이용하여 빠른 속도로 긴 서열을 매칭시키는 것이 특징이다. 5Mbps 정도의 두 서열을 매치시키는데 13초 정도 걸린다고.
관련 paper