Serveur d'exploration MERS - Exploration (Accueil)

Index « Titre (en) » - entrée « fast »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
faso < fast < faster  Facettes :

List of bibliographic references indexed by fast

Number of relevant bibliographic references: 41.
Ident.Authors (with country if any)Title
000081 (2020) Gaëtan Benoit [France] ; Mahendra Mariadassou [France] ; Stéphane Robin [France] ; Sophie Schbath [France] ; Pierre Peterlongo [France] ; Claire Lemaitre [France]SimkaMin: fast and resource frugal de novo comparative metagenomics.
000134 (2020) Jiang Hu [République populaire de Chine] ; Junpeng Fan [République populaire de Chine] ; Zongyi Sun [République populaire de Chine] ; Shanlin Liu [République populaire de Chine]NextPolish: a fast and efficient genome polishing tool for long-read assembly.
000195 (2020) Christopher Pockrandt [États-Unis] ; Mai Alzamel [Royaume-Uni] ; Costas S. Iliopoulos [Royaume-Uni] ; Knut Reinert [Allemagne]GenMap: Ultra-fast Computation of Genome Mappability.
000359 (2019) Xiao Hu ; Iddo FriedbergSwiftOrtho: A fast, memory-efficient, multiple genome orthology classifier
000570 (2019) Yuansheng Liu [Australie] ; Leo Yu Zhang [Australie] ; Jinyan Li [Australie]Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers.
000571 (2019) John A. Lees [États-Unis] ; Simon R. Harris [Royaume-Uni] ; Gerry Tonkin-Hill [Royaume-Uni] ; Rebecca A. Gladstone [Royaume-Uni] ; Stephanie W. Lo [Royaume-Uni] ; Jeffrey N. Weiser [États-Unis] ; Jukka Corander [Royaume-Uni] ; Stephen D. Bentley [Royaume-Uni] ; Nicholas J. Croucher [Royaume-Uni]Fast and flexible bacterial genomic epidemiology with PopPUNK.
000572 (2019) Leonardo Pellegrina [Italie] ; Cinzia Pizzi [Italie] ; Fabio Vandin [Italie]Fast Approximation of Frequent k-Mers and Applications to Metagenomics.
000688 (2019) Sridevi Maharaj [États-Unis] ; Brennan Tracy [États-Unis] ; Wayne B. Hayes [États-Unis]BLANT-fast graphlet sampling tool.
000698 (2019) Umberto Ferraro Petrillo [Italie] ; Mara Sorella [Italie] ; Giuseppe Cattaneo [Italie] ; Raffaele Giancarlo [Italie] ; Simona E. Rombo [Italie]Analyzing big datasets of genomic sequences: fast and scalable collection of k-mer statistics
000926 (2018) F. P. Breitwieser [États-Unis] ; D. N. Baker [États-Unis] ; S. L. Salzberg [États-Unis]KrakenUniq: confident and fast metagenomics classification using unique k-mer counts
000972 (2018) Samuele Girotto ; Matteo Comin ; Cinzia PizziFSH: fast spaced seed hashing exploiting adjacent hashes
000A43 (2018) Xin Li [États-Unis] ; Chong Chu [États-Unis] ; Jingwen Pei [États-Unis] ; Ion M Ndoiu [États-Unis] ; Yufeng Wu [États-Unis]CircMarker: a fast and accurate algorithm for circular RNA detection
000A88 (2018) Magali Jaillard [France] ; Leandro Lima [France] ; Maud Tournoud [France] ; Pierre Mahé [France] ; Alex Van Belkum [France] ; Vincent Lacroix [France] ; Laurent Jacob [France]A fast and agnostic method for bacterial genome-wide association studies: Bridging the gap between k-mers and genetic events
000B08 (2017) Anuj Gupta [États-Unis] ; I King Jordan [États-Unis] ; Lavanya Rishishwar [États-Unis]stringMLST: a fast k-mer based tool for multilocus sequence typing.
000B81 (2017) M Rt Roosaare [Estonie] ; Mihkel Vaher [Estonie] ; Lauris Kaplinski [Estonie] ; M Rt Möls [Estonie] ; Reidar Andreson [Estonie] ; Maarja Lepamets [Estonie] ; Triinu K Ressaar [Estonie] ; Paul Naaber [Estonie] ; Siiri K Ljalg [Estonie] ; Maido Remm [Estonie]StrainSeeker: fast identification of bacterial strains from raw sequencing reads using user-provided guide trees
000D76 (2017) Marius Erbert ; Steffen Rechner ; Matthias Müller-HannemannGerbil: a fast and memory-efficient k-mer counter with GPU-support
001080 (2016) Qiang Yu [République populaire de Chine] ; Hongwei Huo [République populaire de Chine] ; Dazheng Feng [République populaire de Chine]PairMotifChIP: A Fast Algorithm for Discovery of Patterns Conserved in Large ChIP-seq Data Sets
001159 (2016) Maria Hauser [Allemagne] ; Martin Steinegger [Allemagne] ; Johannes Söding [Allemagne]MMseqs software suite for fast and deep clustering and searching of large protein sequence sets.
001177 (2016) Sara El-Metwally [Égypte] ; Magdi Zakaria [Égypte] ; Taher Hamza [Égypte]LightAssembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads.
001253 (2016) Ariya Shajii [États-Unis] ; Deniz Yorukoglu ; Yun William Yu [États-Unis] ; Bonnie Berger [États-Unis]Fast genotyping of known SNPs through approximate k-mer matching.
001254 (2016) Peter Menzel [Danemark] ; Kim Lee Ng [Danemark] ; Anders Krogh [Danemark]Fast and sensitive taxonomic classification for metagenomics with Kaiju
001411 (2016) Armen Abnousi [États-Unis] ; Shira L. Broschat [États-Unis] ; Ananth Kalyanaraman [États-Unis]A Fast Alignment-Free Approach for De Novo Detection of Protein Conserved Regions
001732 (2015) Sebastian Deorowicz [Pologne] ; Marek Kokot [Pologne] ; Szymon Grabowski [Pologne] ; Agnieszka Debudaj-Grabysz [Pologne]KMC 2: fast and resource-frugal k-mer counting.
001875 (2015) Rachid Ounit ; Steve Wanamaker ; Timothy J. Close ; Stefano LonardiCLARK: fast and accurate classification of metagenomic and genomic sequences using discriminative k-mers
001A36 (2014) Eun-Cheon Lim [Allemagne] ; Jonas Müller [Allemagne] ; Jörg Hagmann [Allemagne] ; Stefan R. Henz [Allemagne] ; Sang-Tae Kim [Allemagne] ; Detlef Weigel [Allemagne]Trowel: a fast and accurate error correction module for Illumina sequencing reads.
001B97 (2014) Li Song [États-Unis] ; Liliana Florea [États-Unis] ; Ben Langmead [États-Unis]Lighter: fast and memory-efficient sequencing error correction without counting
001C08 (2014) Peter Audano ; Fredrik VannbergKAnalyze: a fast versatile pipelined K-mer toolkit
001E65 (2013) Maria Hauser [Allemagne] ; Christian E. Mayer [Allemagne, Suisse] ; Johannes Söding [Allemagne]kClust: fast and sensitive clustering of large protein sequence databases
001F32 (2013) Qiang Yu ; Hongwei Huo ; Yipu Zhang ; Hongzhi Guo ; Haitao GuoPairMotif+: A Fast and Effective Algorithm for De Novo Motif Discovery in DNA sequences
002216 (2012) Giorgio Gonnella [Allemagne] ; Stefan Kurtz [Allemagne]Readjoiner: a fast and memory efficient string graph-based sequence assembler
002275 (2012) Mohammed Sahli ; Tetsuo ShibuyaArapan-S: a fast and highly accurate whole-genome assembly software for viruses and small genomes
002475 (2011) Peter Huggins [États-Unis] ; Shan Zhong ; Idit Shiff ; Rachel Beckerman ; Oleg Laptenko ; Carol Prives ; Marcel H. Schulz ; Itamar Simon ; Ziv Bar-JosephDECOD: fast and accurate discriminative DNA motif finding.
002486 (2011) Guillaume Marçais [États-Unis] ; Carl KingsfordA fast, lock-free approach for efficient parallel counting of occurrences of k-mers.
002D11 (2006) Chia C. Shih [États-Unis] ; Solon GeorghiouLarge-amplitude fast motions in double-stranded DNA driven by solvent thermal fluctuations.
002D26 (2006) Padinhateeri Ranjith [États-Unis] ; John F. MarkoFilling of the one-dimensional lattice by k-mers proceeds via fast power-law-like kinetics.
002D58 (2006) James W. Anderson [Royaume-Uni] ; Keith R. Fox ; Graham A. NibloA fast algorithm for the construction of universal footprinting templates in DNA.
003039 (2004) Martin Heule [Suisse] ; Andreas ManzSequential DNA hybridisation assays by fast micromixing.
003219 (2003) Sven Rahmann [Allemagne]Fast large scale oligonucleotide selection using the longest common factor approach.
003E40 (1996) T C Beutler [États-Unis] ; K A DillA fast conformational search strategy for finding low energy structures of model proteins.
004489 (1994) J. Fetzer [Autriche] ; M. Michael [Autriche] ; T. Bohner [Autriche] ; R. Hofbauer [Autriche] ; G. Folkers [Autriche]A Fast Method for Obtaining Highly Pure Recombinant Herpes Simplex Virus Type 1 Thymidine Kinase
004B85 (1988) D. Griffin ; J. Laramée ; M. Deinzer ; E. Stirchak ; D. WellerNegative ion fast atom bombardment mass spectrometry of oligodeoxynucleotide carbamate analogs.

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Sante/explor/MersV1/Data/Main/Exploration
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i -k "fast" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "fast" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Sante
   |area=    MersV1
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Title.i
   |clé=    fast
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Apr 20 23:26:43 2020. Site generation: Sat Mar 27 09:06:09 2021