Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Andrew T Martens"'
Autor:
Cara C Boutte, Balaji S Srinivasan, Jason A Flannick, Antal F Novak, Andrew T Martens, Serafim Batzoglou, Patrick H Viollier, Sean Crosson
Publikováno v:
PLoS Genetics, Vol 4, Iss 12, p e1000310 (2008)
We have experimentally and computationally defined a set of genes that form a conserved metabolic module in the alpha-proteobacterium Caulobacter crescentus and used this module to illustrate a schema for the propagation of pathway-level annotation a
Externí odkaz:
https://doaj.org/article/a496e56e049540f1ac7b79d4b8f34e4b
Publikováno v:
Nucleic Acids Research
The high-throughput sequencing of nuclease-protected mRNA fragments bound to ribosomes, a technique known as ribosome profiling, quantifies the relative frequencies with which different regions of transcripts are translated. This technique has reveal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e56a92b9300eb5c3dbd22227a27f4ee
https://pubmed.ncbi.nlm.nih.gov/25805170
https://pubmed.ncbi.nlm.nih.gov/25805170
Autor:
Todd T. Eckdahl, AMalcolm Campbell, Samuel Thomas Crowley, William C. DeLoache, Jessica Treece, Jeffrey L. Poet, Nickolaus Morton, Laurie J. Heyer, Amber Shoecraft, James O Dickson, Andrew T Martens, Mike Waters, Oyinade Adefuye, Amanda Valencia, Michelle Ritter, Jordan S. Baumgardner, Matthew R. Unzicker, Lane H Heard, Karen Acker
Publikováno v:
Journal of Biological Engineering
Journal of Biological Engineering, Vol 3, Iss 1, p 11 (2009)
Journal of Biological Engineering, Vol 3, Iss 1, p 11 (2009)
Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational comple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b18c3213950ee39c38c8ed0863966de
https://doi.org/10.1186/1754-1611-3-11
https://doi.org/10.1186/1754-1611-3-11