Diff for "MUMmer" - BioHackersNet

Differences between revisions 6 and 7

Maximal Unique Match (er). 두 유전자 배열안에는 반드시 반복되는 공통된 부분을 갖고 있다는 전제를 하고, 이 부분을 MUM이라 한다.

Approach.

once we got unique matches, we still need to find a set of a longest MUMs typically using LIS method

Large Sequence간의 효율적인 SequenceAlignment를 위해 [TIGR]에서 개발한 프로그램.

SuffixTree를 이용하여 빠른 속도로 긴 서열을 매칭시키는 것이 특징이다. 5Mbps 정도의 두 서열을 매치시키는데 13초 정도 걸린다고.

-  ⇤ ← Revision 6 as of 2005-11-20 18:50:44 → 
  Size: 865
  Editor: 128
  Comment:
+   ← Revision 7 as of 2005-11-20 18:52:39 → ⇥
  Size: 874
  Editor: 128
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 1:
-Maximal Unique Match (er)
+Maximal Unique Match (er).
 Line 4:
-Approach 
1. Find MUMs (suffix tree for two genome sequences)
2. find a logest set of MUMs in the increasing order
3. Close the gaps
4. Output entire alignmnet
+Approach.
 1. Find MUMs (suffix tree for two genome sequences).
 2. find a logest set of MUMs in the increasing order.
 3. Close the gaps.
 4. Output entire alignmnet.