Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Pachter L"'
Publikováno v:
BMC Bioinformatics, Vol 12, Iss 1, p 451 (2011)
Abstract Background A feature common to all DNA sequencing technologies is the presence of base-call errors in the sequenced reads. The implications of such errors are application specific, ranging from minor informatics nuisances to major problems a
Externí odkaz:
https://doaj.org/article/dca10fdb313a401d9aa9f0b4047c97d7
Publikováno v:
BMC Bioinformatics, Vol 12, Iss 1, p 15 (2011)
Abstract Background The identification of binding targets for proteins using ChIP-Seq has gained popularity as an alternative to ChIP-chip. Sequencing can, in principle, eliminate artifacts associated with microarrays, and cheap sequencing offers the
Externí odkaz:
https://doaj.org/article/8489192b97c34c08aac8bacb95f0efb1
Publikováno v:
BMC Bioinformatics, Vol 11, Iss 1, p 430 (2010)
Abstract Background We study the statistical properties of fragment coverage in genome sequencing experiments. In an extension of the classic Lander-Waterman model, we consider the effect of the length distribution of fragments. We also introduce a c
Externí odkaz:
https://doaj.org/article/1ecbcbcf0ac745e4ad5118f9a179c34c
Publikováno v:
Algorithms for Molecular Biology, Vol 3, Iss 1, p 5 (2008)
Abstract The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. From this point of view, NJ is "optimal" when the algorithm outp
Externí odkaz:
https://doaj.org/article/499a2494a67c44e08a5ea9ae75c3bda8