Literature DB >> 7583690

An algorithm for analysing probed partial digestion experiments.

R M Karp1, L A Newberg.   

Abstract

A partial digestion of DNA (e.g. cosmid. Lambda, YAC, chromosome) is performed and the lengths of thoses fragments which hybridize to a labeled probe are measured using gel electrophoresis. We give an efficient algorithm that takes as input this experimental data and proposes one or more candidate solutions. Each solution designates the location of each restriction site and specifies the endpoints of each fragment. (Further experiments can then be designed to select the correct solution from this small set of candidates.) The algorithm works well even when the experiment gives inexact values for the lengths.

Mesh:

Substances:

Year:  1995        PMID: 7583690     DOI: 10.1093/bioinformatics/11.3.229

Source DB:  PubMed          Journal:  Comput Appl Biosci        ISSN: 0266-7061


  2 in total

1.  A fast exact sequential algorithm for the partial digest problem.

Authors:  Mostafa M Abbas; Hazem M Bahig
Journal:  BMC Bioinformatics       Date:  2016-12-22       Impact factor: 3.169

2.  Mapping genes within a YAC by computer-assisted interpretation of partial restriction digestions.

Authors:  D C Shields; A Butler; K R Mosurski; M T Walsh; A S Whitehead
Journal:  Nucleic Acids Res       Date:  1996-11-15       Impact factor: 16.971

  2 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.