SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-50440"
 

Search: onr:"swepub:oai:DiVA.org:kth-50440" > Design optimization...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Bertone, PaulYale University (author)

Design optimization methods for genomic DNA tiling arrays.

  • Article/chapterEnglish2006

Publisher, publication year, extent ...

  • 2005-12-19
  • Cold Spring Harbor Laboratory,2006
  • printrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:kth-50440
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-50440URI
  • https://doi.org/10.1101/gr.4452906DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:art swepub-publicationtype

Notes

  • A recent development in microarray research entails the unbiased coverage, or tiling, of genomic DNA for the large-scale identification of transcribed sequences and regulatory elements. A central issue in designing tiling arrays is that of arriving at a single-copy tile path, as significant sequence cross-hybridization can result from the presence of non-unique probes on the array. Due to the fragmentation of genomic DNA caused by the widespread distribution of repetitive elements, the problem of obtaining adequate sequence coverage increases with the sizes of subsequence tiles that are to be included in the design. This becomes increasingly problematic when considering complex eukaryotic genomes that contain many thousands of interspersed repeats. The general problem of sequence tiling can be framed as finding an optimal partitioning of non-repetitive subsequences over a prescribed range of tile sizes, on a DNA sequence comprising repetitive and non-repetitive regions. Exact solutions to the tiling problem become computationally infeasible when applied to large genomes, but successive optimizations are developed that allow their practical implementation. These include an efficient method for determining the degree of similarity of many oligonucleotide sequences over large genomes, and two algorithms for finding an optimal tile path composed of longer sequence tiles. The first algorithm, a dynamic programming approach, finds an optimal tiling in linear time and space; the second applies a heuristic search to reduce the space complexity to a constant requirement. A Web resource has also been developed, accessible at http://tiling.gersteinlab.org, to generate optimal tile paths from user-provided DNA sequences.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Trifonov, ValeryYale University (author)
  • Rozowsky, Joel SYale University (author)
  • Schubert, FalkYale University (author)
  • Emanuelsson, OlofYale University(Swepub:kth)u15t3py5 (author)
  • Karro, JohnYale University (author)
  • Kao, Ming-YangNorthwestern University (author)
  • Snyder, MichaelYale University (author)
  • Gerstein, MarkYale University (author)
  • Yale UniversityNorthwestern University (creator_code:org_t)

Related titles

  • In:Genome Research: Cold Spring Harbor Laboratory16:2, s. 271-2811088-90511549-5469

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view