Rezultati

Priporočene teme znotraj vašega iskanja.
Refine Results
  1. 1
    Measure representation and multifractal analysis of complete genomes

    Measure representation and multifractal analysis of complete genomes od Zu-Guo Yu, Vo Anh, Ka‐Sing Lau

    Izdano 2001
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  2. 2
    Genome comparison without alignment using shortest unique substrings

    Genome comparison without alignment using shortest unique substrings od Bernhard Haubold, Nora Pierstorff, Friedrich Möller, Thomas Wiehe

    Izdano 2005
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  3. 3
    Variable-Order de Bruijn Graphs

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

    Izdano 2015
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  4. 4
    The Average Common Substring Approach to Phylogenomic Reconstruction

    The Average Common Substring Approach to Phylogenomic Reconstruction od Igor Ulitsky, David Burstein, Tamir Tuller, Benny Chor

    Izdano 2006
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  5. 5
    Multifractal and correlation analyses of protein sequences from complete genomes

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

    Izdano 2003
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  6. 6
    Disk-based k-mer counting on a PC

    Disk-based k-mer counting on a PC od Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Szymon Grabowski

    Izdano 2013
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  7. 7
    Finding Motifs Using Random Projections

    Finding Motifs Using Random Projections od Jeremy Buhler, Martin Tompa

    Izdano 2002
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  8. 8
    DSK: <i>k</i>-mer counting with very low memory usage

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

    Izdano 2013
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  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 od Guillaume Marçais, Carl Kingsford

    Izdano 2011
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  10. 10
    miR-192 Mediates TGF-β/Smad3-Driven Renal Fibrosis

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

    Izdano 2010
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  11. 11
    Predicting Gene Regulatory Elements in Silico on a Genomic Scale

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

    Izdano 1998
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  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 od Sebastian Horwege, Sebastian Lindner, Marcus Boden, Klas Hatje, Martin Kollmar, Chris-André Leimeister, Burkhard Morgenstern

    Izdano 2014
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  13. 13
    KMC 2: fast and resource-frugal <i>k</i>-mer counting

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

    Izdano 2015
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  14. 14
    Learning Interpretable SVMs for Biological Sequence Classification

    Learning Interpretable SVMs for Biological Sequence Classification od Gunnar Rätsch, Sören Sonnenburg, Christin Schäfer

    Izdano 2006
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  15. 15
    Reducing storage requirements for biological sequence comparison

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

    Izdano 2004
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  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 od Guillaume Holley, Roland Wittler, Jens Stoye

    Izdano 2016
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  17. 17
    A history of DNA sequence assembly

    A history of DNA sequence assembly od Eugene W. Myers

    Izdano 2016
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  18. 18
    Discovering frequently recurring movement sequences in team-sport athlete spatiotemporal data

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

    Izdano 2017
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  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 od Mladen Kovačević, Vincent Y. F. Tan

    Izdano 2018
    Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:
  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 od Swati Manekar, S. R. Sathe

    Izdano 2018
    Polni tekst Polni tekst
    Artigo
    Dodaj v priljubljene
    Shranjeno v:

Iskalna orodja: