Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Genetic mapping”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 793 records · Page 44Linked to original sources
PubMed2003

Nearly complete genetic maps of Pinus sylvestris L. (Scots pine) constructed by AFLP marker analysis in a full-sib family.

We have constructed nearly complete linkage maps of Pinus sylvestris (L.) using AFLP markers based on a two-way pseudo-testcross strategy in a full-sib family founded in an advanced breeding program. With 39 primer combinations, a total of 737 markers (320 from the mother and 417 from the father) segregated in a 1:1 ratio, corresponding to DNA polymorphism: heterozygous in one parent and null in the other. In the maternal parent, 188 framework markers were mapped in 12 linkage groups, equivalent to the Pinus haploid chromosome number, with a total coverage of 1,695.5 cM. In the paternal parent, 245 framework markers established a map with 15 linkage groups, spanning a genome length of 1,718.5 cM. The estimated total map length was L(F) = 1,681 cM for the female and L(M) = 1,645 cM for the male using a modified method-of-moment estimator. Combining these values with those estimated from the observed map lengths in both parents, we estimated the genome length in Scots pine to be between 1,600 and 2,100 cM. Our genome coverage was estimated to be more than 98% with a framework marker interval of 20 cM for both parents. Most of the female and male linkage groups were associated through the analysis of the intercross markers.

Chromosome Mapping↗
PubMed2005

Inheritance and genetic mapping of tuber eye depth in cultivated diploid potatoes.

Tuber eye depth of the potato (Solanum tuberosum L.) is an important trait for the processing quality and appearance of potatoes. In the present study, we used a cultivated diploid potato family (12601) of 107 plants to dissect the mode of inheritance and to map the gene(s) controlling the trait. The family segregated for both eye depth (deep vs shallow) and tuber shape (round vs long) traits. The deep eye (Eyd) phenotype was found to be associated with round tubers (Ro) in most progeny clones. Further evaluation of this population with molecular markers including simple sequence repeats, amplified fragment length polymorphism, and sequence-characterized amplified regions revealed that the primary locus for eye depth is located on chromosome 10. This map location was confirmed by evaluating a second diploid family (12586). The results of this study led to the following conclusions: (1) there is a major locus controlling the eye depth trait; (2) deep eye (Eyd) is dominant to shallow (eyd); (3) the Eyd/eyd locus is located on chromosome 10; and (4) the Eyd/eyd locus is closely linked with the major locus for tuber shape (Ro/ro), at a distance of about 4 cM.

Agriculture↗
PubMed1997

Cloning and genetic mapping of wheat telomere-associated sequences.

Wheat telomere-associated sequences (TASs) were cloned using a Vectorette approach and sequenced. Reverse primers specific to the TASs were combined with labelled degenerate telomere primers in PCR reactions containing total genomic DNA as template. Amplification products were separated on sequencing gels. In total, seventeen primer combinations provided 47 polymorphic fragments. Nine of these mapped beyond the most distal RFLP markers and defined the ends of seven chromosome arms. Seven of the nine terminal fragments were derived from a 118-bp tandem repeat, indicating that subtelomeric tandem repeat sequences provide an efficient means to target chromosome ends. A telomere cloning strategy and the terminal and interstitial location of TASs are discussed.

Base Sequence↗
PubMed2004

Genetic mapping and ENU mutagenesis.

ENU mutagenesis is a potent means to generate novel mutations in the mouse, and the further investigation of these mutations can be logistically demanding. Determination of the map position of a mutation early in its characterization can be extremely useful. We describe how the use of interval haplotype analysis can facilitate this with even small numbers of affected progeny.

Animals↗
PubMed1986

Nucleotide sequence and genetic map of the 16-kb vaccinia virus HindIII D fragment.

We have determined the nucleotide sequence of the 16,059-bp HindIII D fragment from vaccinia virus strain WR. Translation in all 6 reading frames reveals a set of 22 open reading frames (ORFs), which are capable of encoding proteins ranging from 61 to 844 amino acids in length. With one exception, ORF 12, we have divided them into two primary sets according to their size. The minor group contains eight members ranging in length from 61 to 84 amino acids. The major group has thirteen members varying from 146 to 844 amino acids in length, and, in addition, due to its location on the DNA, one small ORF, 61 amino acids long. The neighboring major ORFs are closely packed along the DNA, being separated by 42 or fewer base pairs. In several instances the ends of adjoining ORFs overlap for up to 11 triplet codons. In three cases, 1 or 2 bases are shared between translation start and stop signals in adjacent ORFs. Regions of both strands of the DNA are transcribed. Two sets of temperature-sensitive mutations, totaling 17, which map to the HindIII D fragment, have been combined into eight complementation groups. The results of marker rescue analysis map one or more member of each group to a site in the HindIII D fragment within a defined open reading frame.

Amino Acid Sequence↗
PubMed2003

Constructing large-scale genetic maps using an evolutionary strategy algorithm.

This article is devoted to the problem of ordering in linkage groups with many dozens or even hundreds of markers. The ordering problem belongs to the field of discrete optimization on a set of all possible orders, amounting to n!/2 for n loci; hence it is considered an NP-hard problem. Several authors attempted to employ the methods developed in the well-known traveling salesman problem (TSP) for multilocus ordering, using the assumption that for a set of linked loci the true order will be the one that minimizes the total length of the linkage group. A novel, fast, and reliable algorithm developed for the TSP and based on evolution-strategy discrete optimization was applied in this study for multilocus ordering on the basis of pairwise recombination frequencies. The quality of derived maps under various complications (dominant vs. codominant markers, marker misclassification, negative and positive interference, and missing data) was analyzed using simulated data with approximately 50-400 markers. High performance of the employed algorithm allows systematic treatment of the problem of verification of the obtained multilocus orders on the basis of computing-intensive bootstrap and/or jackknife approaches for detecting and removing questionable marker scores, thereby stabilizing the resulting maps. Parallel calculation technology can easily be adopted for further acceleration of the proposed algorithm. Real data analysis (on maize chromosome 1 with 230 markers) is provided to illustrate the proposed methodology.

Algorithms↗