Torthaí cuardaigh

Topaicí molta laistigh de do chuardach.
Beachtaigh na torthaí
  1. 1
    Measure representation and multifractal analysis of complete genomes

    Measure representation and multifractal analysis of complete genomes de réir Zu-Guo Yu, Vo Anh, Ka‐Sing Lau

    Foilsithe / Cruthaithe 2001
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  2. 2
    Genome comparison without alignment using shortest unique substrings

    Genome comparison without alignment using shortest unique substrings de réir Bernhard Haubold, Nora Pierstorff, Friedrich Möller, Thomas Wiehe

    Foilsithe / Cruthaithe 2005
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  3. 3
    Variable-Order de Bruijn Graphs

    Variable-Order de Bruijn Graphs de réir Christina Boucher, Alex Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane

    Foilsithe / Cruthaithe 2015
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  4. 4
    The Average Common Substring Approach to Phylogenomic Reconstruction

    The Average Common Substring Approach to Phylogenomic Reconstruction de réir Igor Ulitsky, David Burstein, Tamir Tuller, Benny Chor

    Foilsithe / Cruthaithe 2006
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  5. 5
    Multifractal and correlation analyses of protein sequences from complete genomes

    Multifractal and correlation analyses of protein sequences from complete genomes de réir Zu‐Guo Yu, Vo Anh, Ka‐Sing Lau

    Foilsithe / Cruthaithe 2003
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  6. 6
    Disk-based k-mer counting on a PC

    Disk-based k-mer counting on a PC de réir Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Szymon Grabowski

    Foilsithe / Cruthaithe 2013
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  7. 7
    Finding Motifs Using Random Projections

    Finding Motifs Using Random Projections de réir Jeremy Buhler, Martin Tompa

    Foilsithe / Cruthaithe 2002
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  8. 8
    DSK: <i>k</i>-mer counting with very low memory usage

    DSK: <i>k</i>-mer counting with very low memory usage de réir Guillaume Rizk, Dominique Lavenier, Rayan Chikhi

    Foilsithe / Cruthaithe 2013
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  9. 9
    A fast, lock-free approach for efficient parallel counting of occurrences of <i>k</i>-mers

    A fast, lock-free approach for efficient parallel counting of occurrences of <i>k</i>-mers de réir Guillaume Marçais, Carl Kingsford

    Foilsithe / Cruthaithe 2011
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  10. 10
    miR-192 Mediates TGF-β/Smad3-Driven Renal Fibrosis

    miR-192 Mediates TGF-β/Smad3-Driven Renal Fibrosis de réir Arthur C.K. Chung, Xiao Ru Huang, Xiao‐Ming Meng, Hui Y. Lan

    Foilsithe / Cruthaithe 2010
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  11. 11
    Predicting Gene Regulatory Elements in Silico on a Genomic Scale

    Predicting Gene Regulatory Elements in Silico on a Genomic Scale de réir Alvis Brāzma, Inge Jonassen, Jaak Vilo, Esko Ukkonen

    Foilsithe / Cruthaithe 1998
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  12. 12
    Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches

    Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches de réir Sebastian Horwege, Sebastian Lindner, Marcus Boden, Klas Hatje, Martin Kollmar, Chris-André Leimeister, Burkhard Morgenstern

    Foilsithe / Cruthaithe 2014
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  13. 13
    KMC 2: fast and resource-frugal <i>k</i>-mer counting

    KMC 2: fast and resource-frugal <i>k</i>-mer counting de réir Sebastian Deorowicz, Marek Kokot, Szymon Grabowski, Agnieszka Debudaj-Grabysz

    Foilsithe / Cruthaithe 2015
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  14. 14
    Learning Interpretable SVMs for Biological Sequence Classification

    Learning Interpretable SVMs for Biological Sequence Classification de réir Gunnar Rätsch, Sören Sonnenburg, Christin Schäfer

    Foilsithe / Cruthaithe 2006
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  15. 15
    Reducing storage requirements for biological sequence comparison

    Reducing storage requirements for biological sequence comparison de réir Michael Roberts, Wayne B. Hayes, Brian R. Hunt, Stephen M. Mount, James A. Yorke

    Foilsithe / Cruthaithe 2004
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  16. 16
    Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage

    Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage de réir Guillaume Holley, Roland Wittler, Jens Stoye

    Foilsithe / Cruthaithe 2016
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  17. 17
    A history of DNA sequence assembly

    A history of DNA sequence assembly de réir Eugene W. Myers

    Foilsithe / Cruthaithe 2016
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  18. 18
    Discovering frequently recurring movement sequences in team-sport athlete spatiotemporal data

    Discovering frequently recurring movement sequences in team-sport athlete spatiotemporal data de réir Alice J. Sweeting, Robert J. Aughey, Stuart J. Cormack, Stuart Morgan

    Foilsithe / Cruthaithe 2017
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  19. 19
    Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems

    Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems de réir Mladen Kovačević, Vincent Y. F. Tan

    Foilsithe / Cruthaithe 2018
    Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:
  20. 20
    A benchmark study of k-mer counting methods for high-throughput sequencing

    A benchmark study of k-mer counting methods for high-throughput sequencing de réir Swati Manekar, S. R. Sathe

    Foilsithe / Cruthaithe 2018
    Faigh an téacs iomlán Faigh an téacs iomlán
    Artigo
    Cuir le mo chuid Ceanán
    Sábháilte in:

Uirlisí cuardaigh: