Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Peak-Finder Meta Server for ChIP-Seq Analysis
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2011 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Chromatin immunoprecipitation (ChIP) coupled with ultra high-throughput parallel sequencing (ChIP-seq) is widely used to study transcriptional regulation on a genome wide scale. Numerous computational tools have been developed to identify transcription factor (protein) binding sites from large ChIP-seq datasets. The diversity of the datasets and the algorithm dependencies make it hard to get a satisfactory result.

Many studies have compared the performance and accuracy of the algorithms using empirical datasets. It is shown that selecting the best algorithm to analyze a ChIP-seq dataset for detecting binding sites of a specific transcription factor depends on the dataset conditions. A systematic solution to compare the results of multiple algorithms to produce the best putative binding sites is still lacking.

In this thesis project a new software package was introduced to provide a single interface for several state-of-the-art algorithms. A voting mechanism and a scoring mechanism were implemented to identify a set of the best predicted transcription factor binding sites (peaks) by normalizing and comparing the predicted peaks of the selected algorithms. The methods were applied on some publicly available datasets and the results were validated by comparing them to the results of the selected algorithms and their corresponding binding motifs. The discovered motifs showed a very high similarity to the consensus motifs of the selected transcription factors.

Place, publisher, year, edition, pages
2011.
Series
IT, 11 039
Identifiers
URN: urn:nbn:se:uu:diva-156436OAI: oai:DiVA.org:uu-156436DiVA: diva2:431600
Educational program
Master Programme in Computer Science
Uppsok
Technology
Supervisors
Examiners
Available from: 2011-07-21 Created: 2011-07-21 Last updated: 2011-08-01Bibliographically approved

Open Access in DiVA

fulltext(956 kB)567 downloads
File information
File name FULLTEXT01.pdfFile size 956 kBChecksum SHA-512
4c5b8aeed5a98b57b453c6d16fac63425e4703d999c5416bb4383902e5c8236bddb0ed71bc5b5a0dfbb1a3b3f167537196b2f81e294df0bf47559704d4aeb2bc
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 567 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 468 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf