z-logo
Premium
Search and repair of bona fide base‐pair mismatches in DNA
Author(s) -
Hingorani Manju M,
Zhai Jie
Publication year - 2009
Publication title -
the faseb journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.709
H-Index - 277
eISSN - 1530-6860
pISSN - 0892-6638
DOI - 10.1096/fasebj.23.1_supplement.836.10
Subject(s) - msh2 , dna mismatch repair , base pair , dna , mutagenesis , genetics , biology , dna repair , limiting , computational biology , mutation , gene , mechanical engineering , engineering
The DNA mismatch repair system (MMR) helps maintain genome integrity by correcting base‐pair mismatches and insertion/deletion loops in DNA. MMR proteins are thus critical for limiting mutagenesis, and their malfunction is linked to sporadic cancers and the HNPCC syndrome. MutS proteins perform the challenging task of finding a few errors against a background of millions of correct base pairs in DNA, and initiate repair. In order to understand the mechanism by which MutS proteins locate these errors, we measured the movement of S. cerevisiae MutS (Msh2‐6), between near Watson‐Crick (2‐Aminopurine:T) and mismatched (G:T) base‐pair sites on DNA. We found that Msh2‐6 binds both sites at equally high rates (2x10 7 M −1 s −1 ), but it leaves the matched site ~50‐fold faster than the mismatched site (t 1/2 ~ 0.4 versus 18 s, respv). These data suggest that while Msh2‐6 makes similar initial contacts with various base pairs, it recognizes mismatches by forming stable contacts specifically at these sites. Notably, Msh2‐6 leaves the matched site and arrives at the mismatched site without dissociating from DNA, which suggests that the protein slides on DNA, probing base pairs via transient contacts until it is trapped at a bona fide mismatch. A sliding mechanism likely enables MutS proteins to scan long stretches of DNA rapidly, thereby ensuring efficient repair of infrequent aberrations in the double helix. Research support: NSF.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here