title: [Paths in graphs and selection of oligonucleotide linkers].
abstract: The problem of search of an universal linker with minimal length containing all restriction endonuclease recognition sites is considered. We reduce this problem to the search of Eiler's and Hamilton's paths in graph. The use of the discrete optimization methods allows to construct the linker with the length closed to the minimum.
authors.forename: P A
authors.initials: PA
authors.lastname: Pevzner
authors.forename: V P
authors.initials: VP
authors.lastname: Veĭko
mesh_terms: D001483:Base Sequence; D004262:DNA Restriction Enzymes; D008962:Models, Theoretical; D008969:Molecular Sequence Data; D009841:Oligonucleotides; D013379:Substrate Specificity
chemical_list: D009841:Oligonucleotides; D004262:DNA Restriction Enzymes
vernacular_title: Obkhody grafov i bybor oligonukleotidnykh linkerov.