Filtrer vos résultats
- 72
- 48
- 51
- 44
- 16
- 5
- 2
- 1
- 1
- 9
- 117
- 23
- 1
- 4
- 3
- 5
- 7
- 4
- 2
- 4
- 3
- 5
- 7
- 3
- 4
- 4
- 4
- 4
- 3
- 2
- 7
- 10
- 11
- 3
- 2
- 5
- 8
- 3
- 1
- 1
- 1
- 114
- 3
- 2
- 1
- 48
- 48
- 47
- 22
- 19
- 7
- 7
- 7
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 120
- 33
- 19
- 7
- 7
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
120 résultats
|
Efficient Tree-Structured Categorical Retrieval31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), Jun 2020, Copenhagen, Denmark. ⟨10.4230/LIPIcs.CPM.2020.4⟩
Communication dans un congrès
hal-03049420v1
|
||
|
Efficient alternatives to PSI-BLASTBulletin of the Polish Academy of Sciences: Technical Sciences, 2012, 60 (3), pp.495-505. ⟨10.2478/v10175-012-0063-0⟩
Article dans une revue
hal-00749016v1
|
||
|
Algorithms for path-constrained sequence alignmentJournal of Discrete Algorithms, 2014, 24, pp.48-58. ⟨10.1016/j.jda.2013.09.003⟩
Article dans une revue
hal-00824726v1
|
||
|
Rapid heuristic inference of antibiotic resistance and susceptibility by genomic neighbor typing2019
Pré-publication, Document de travail
hal-02414869v1
|
||
|
Improved hit criteria for DNA local alignment.BMC Bioinformatics, 2004, 5 (149), pp.1-9. ⟨10.1186/1471-2105-5-149⟩
Article dans une revue
inria-00448743v1
|
||
|
Designing Efficient Spaced Seeds for SOLiD Read Mapping.Advances in Bioinformatics, 2010, ⟨10.1155/2010/708501⟩
Article dans une revue
inria-00527029v1
|
||
|
Dynamic read mapping and online consensus calling for better variant detection2016
Pré-publication, Document de travail
hal-01323188v1
|
||
How Many Square Occurrences Must a Binary Sequence Contain?The Electronic Journal of Combinatorics, 2003, 10, pp.R12
Article dans une revue
hal-00307205v1
|
|||
|
On repetition-free binary words of minimal density23rd International Symposium on Mathematical Foundations of Computer Science - MFCS'98, 1998, Brno/Czech Republic, pp.683-692, ⟨10.1007/BFb0055819⟩
Communication dans un congrès
inria-00098692v1
|
||
The complexity of some complementation problemsInformation Processing Letters, 1999, 71 (3-4), pp.159-165
Article dans une revue
inria-00098851v1
|
|||
|
Absent words in a sliding window with applicationsInformation and Computation, 2019, pp.104461. ⟨10.1016/j.ic.2019.104461⟩
Article dans une revue
hal-02414839v1
|
||
|
Diversity of monomers in nonribosomal peptides: towards the prediction of origin and biological activity.Journal of Bacteriology, 2010, 192 (19), pp.5143-50. ⟨10.1128/JB.00315-10⟩
Article dans une revue
hal-00641488v1
|
||
|
Minimally-overlapping words for sequence similarity searchBioinformatics, 2020, ⟨10.1093/bioinformatics/btaa1054⟩
Article dans une revue
hal-03087470v1
|
||
|
Regular expression constrained sequence alignment revisitedJournal of Computational Biology, 2011, 18 (5), pp.771-781. ⟨10.1089/cmb.2010.0291⟩
Article dans une revue
hal-00790008v1
|
||
Periodic Structures in Wordsnone. 3rd Lothaire volume Applied Combinatorics on Words, Cambridge University Press, pp.399-442, 2004
Chapitre d'ouvrage
inria-00100125v1
|
|||
|
Actes de la Réunion des Actions Spécifiques "Algorithmes et Séquences" et Indexation de Texte et Découverte de Motifs03032, 2003, pp.15
Rapport
lirmm-00191958v1
|
||
YASS : similarity search in DNA sequencesThe Seventh Annual International Conference on Research in Computational Molecular Biology - RECOMB'03, Apr 2003, Berlin, Germany, 1 p
Communication dans un congrès
inria-00099599v1
|
|||
|
Finding approximate repetitions under Hamming distanceTheoretical Computer Science, 2003, 303 (1), pp.135-156. ⟨10.1016/S0304-3975(02)00448-6⟩
Article dans une revue
inria-00099592v1
|
||
|
Reconstructing Set PartitionsTenth Annual ACM-SIAM Symposium on Discrete Algorithms - SODA'99, 1999, Baltimore, Maryland/US, pp.2
Communication dans un congrès
inria-00098744v1
|
||
Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical MappingDiscrete Applied Mathematics, 1998, 88 (1-3), pp.147-165
Article dans une revue
inria-00098545v1
|
|||
|
YASS: Similarity search in DNA sequences[Research Report] RR-4852, INRIA. 2003, pp.20
Rapport
inria-00071731v1
|
||
|
Phase Transition in Count Approximation by Count-Min Sketch with Conservative Updates13th International Conference on Algorithms and Complexity (CIAC 2023), Jun 2023, Larnaca, Cyprus. pp.232-246, ⟨10.1007/978-3-031-30448-4_17⟩
Communication dans un congrès
hal-04287710v1
|
||
|
Count-Min Sketch with Variable Number of Hash Functions: An Experimental StudyProceedings of the 30th International Symposium on String Processing and Information Retrieval (SPIRE'23), Pisa (Italy), Septembre 26-28, 2023, Sep 2023, Pisa, Italy. pp.218-232, ⟨10.1007/978-3-031-43980-3_17⟩
Communication dans un congrès
hal-04287771v1
|
||
Identification of transcription factor binding sites in the genome of Streptomyces coelicolor A3(2)3ème Journées Post-Génomique de la DOUA 2003 - JPGD'03, 2003, Lyon, France
Communication dans un congrès
inria-00099609v1
|
|||
|
Computing discriminating and generic wordsString Processing and Information Retrieval, Oct 2012, Cartagena de Indias, Colombia. pp.307-317, ⟨10.1007/978-3-642-34109-0_32⟩
Communication dans un congrès
hal-00789986v1
|
||
|
Computing the Longest Unbordered SubstringProc. of the 22nd International Symposium on String Processing and Information Retrieval (SPIRE), September 1-4, 2015, London, UK, Sep 2015, London, United Kingdom. pp.12, ⟨10.1007/978-3-319-23826-5_24⟩
Communication dans un congrès
hal-01250721v1
|
||
|
Cross-Document Pattern MatchingJournal of Discrete Algorithms, 2014, 24, pp.40-47. ⟨10.1016/j.jda.2013.05.002⟩
Article dans une revue
hal-00842364v1
|
||
|
Approximate String Matching Using a Bidirectional IndexCPM 2014, Jun 2014, Moscow, Russia. pp.222-231, ⟨10.1007/978-3-319-07566-2_23⟩
Communication dans un congrès
hal-01086206v1
|
||
|
Full-Fledged Real-Time Indexing for Constant Size AlphabetsAlgorithmica, 2017, 79 (2), pp.387-400. ⟨10.1007/s00453-016-0199-7⟩
Article dans une revue
hal-01802943v1
|
||
|
Back-translation for discovering distant protein homologiesthe 9th International Workshop in Algorithms in Bioinformatics (WABI), Sep 2009, Philadelphia, United States. pp.108-120, ⟨10.1007/978-3-642-04241-6_10⟩
Communication dans un congrès
inria-00448741v1
|