Computer-assisted sequencing, interval graphs, and molecular evolution
In 1945, Fox developed the strategy for sequencing long proteins by using overlapping fragments. We show how the formal mathematical technique for the construction of interval graphs (Gilmore and Hoffman, 1964) is useful both pedagogically for understanding the underlying logic of sequencing linear...
        Saved in:
      
    
          | Published in | BioSystems Vol. 15; no. 3; pp. 259 - 273 | 
|---|---|
| Main Authors | , , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
        Ireland
          Elsevier Ireland Ltd
    
        1982
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0303-2647 1872-8324  | 
| DOI | 10.1016/0303-2647(82)90010-7 | 
Cover
| Summary: | In 1945, Fox developed the strategy for sequencing long proteins by using overlapping fragments. We show how the formal mathematical technique for the construction of interval graphs (Gilmore and Hoffman, 1964) is useful both pedagogically for understanding the underlying logic of sequencing linear molecules and is more amenable to automation because of its algorithmic nature. We also present a computer program, that employs the interval graph algorithm, which can be used to sequence proteins when given digest data. An example is given to illustrate all the steps involved in the algorithmic processing of the data. The need for such developments with respect to molecular evolution is discussed. | 
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23  | 
| ISSN: | 0303-2647 1872-8324  | 
| DOI: | 10.1016/0303-2647(82)90010-7 |