LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens ; volume:9 ; number:1 ; day:10 ; month:9 ; year:2008 ; pages:1-11 ; date:12.2008
BMC bioinformatics ; 9, Heft 1 (10.9.2008), 1-11, 12.2008
- Creator
-
Lee, Wah Heng
- Contributor
-
Wong, Christopher W.
Leong, Wan Yee
Miller, Lance D.
Sung, Wing Kin
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-9-368
- URN
-
urn:nbn:de:1111-20160217700
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:20 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lee, Wah Heng
- Wong, Christopher W.
- Leong, Wan Yee
- Miller, Lance D.
- Sung, Wing Kin
- SpringerLink (Online service)
Other Objects (12)
Scaling Properties of the Number of Random Sequential Adsorption Iterations Needed to Generate Saturated Random Packing
Dual-stage constructed random graph algorithm to generate random graphs featuring the same topological characteristics with power grids
A quantum circuit to generate random numbers within a specific interval
Random walks in random environment : random orientations and branching
Random Walks in Random Environment: Random Orientations and Branching
Random sets versus random sequences
Random and quasi-random point sets
Random axon outgrowth and synaptic competition generate realistic connection lengths and filling fractions
Topics on random polynomials and random polytopes
A random shock is not random assignment
Random planar structures and random graph processes
Random strict partitions and random shifted tableaux
Scaling Properties of the Number of Random Sequential Adsorption Iterations Needed to Generate Saturated Random Packing
Dual-stage constructed random graph algorithm to generate random graphs featuring the same topological characteristics with power grids
A quantum circuit to generate random numbers within a specific interval
Random walks in random environment : random orientations and branching
Random Walks in Random Environment: Random Orientations and Branching
Random sets versus random sequences
Random and quasi-random point sets
Random axon outgrowth and synaptic competition generate realistic connection lengths and filling fractions
Topics on random polynomials and random polytopes
A random shock is not random assignment
Random planar structures and random graph processes
Random strict partitions and random shifted tableaux
Scaling Properties of the Number of Random Sequential Adsorption Iterations Needed to Generate Saturated Random Packing
Dual-stage constructed random graph algorithm to generate random graphs featuring the same topological characteristics with power grids
A quantum circuit to generate random numbers within a specific interval
Random walks in random environment : random orientations and branching
Random Walks in Random Environment: Random Orientations and Branching
Random sets versus random sequences
Random and quasi-random point sets
Random axon outgrowth and synaptic competition generate realistic connection lengths and filling fractions
Topics on random polynomials and random polytopes
A random shock is not random assignment
Random planar structures and random graph processes