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
- 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
120 résultats
|
Maximal Repetitions and Application to DNA sequencesJournées Ouvertes : Biologie, Informatique et Mathématiques - JOBIM'2000, 2000, Montpellier/France, pp.165--172
Communication dans un congrès
inria-00107854v1
|
||
mreps: a program for exhaustive search for tandem repeats in DNA sequencesSixth Annual International Conference on Research in Computational Biology - RECOMB 2002, Apr 2002, Washington, DC, US
Communication dans un congrès
inria-00100869v1
|
|||
|
Finding Repeats With Fixed Gap7th International Symposium on String Processing & Information Retrieval - SPIRE 2000, 2000, Coruna, Spain, pp.162--168
Communication dans un congrès
inria-00107855v1
|
||
|
Estimating seed sensitivity on homogeneous alignments[Research Report] RR-5047, INRIA. 2003, pp.17
Rapport
inria-00071536v1
|
||
|
Subset seed automatonCIAA 2007, Jul 2007, Prague, Czech Republic. pp.180-191, ⟨10.1007/978-3-540-76336-9_18⟩
Communication dans un congrès
inria-00170414v1
|
||
|
On subset seeds for protein alignmentIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2009, 6 (3), pp.483-494. ⟨10.1109/TCBB.2009.4⟩
Article dans une revue
inria-00354773v1
|
||
|
Efficient seeding techniques for protein similarity searchProceedings of the 2nd International Conference BIRD, Jul 2008, Vienna, Austria. pp.466-478, ⟨10.1007/978-3-540-70600-7⟩
Communication dans un congrès
inria-00335564v1
|
||
|
Special Issue on Computer Science Symposium in Russia (2019)Theory of Computing Systems, 2021, 65, pp.441 - 443. ⟨10.1007/s00224-021-10033-0⟩
Article dans une revue
hal-03447240v1
|
||
|
Minimally-overlapping words for sequence similarity search2020
Pré-publication, Document de travail
hal-03049398v1
|
||
|
Structural pattern matching of nonribosomal peptides.BMC Structural Biology, 2009, 9 (15), ⟨10.1186/1472-6807-9-15⟩
Article dans une revue
hal-00641486v1
|
||
|
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern MatchingFundamentals of Computation Theory, Sep 2017, Bordeaux, France. pp.164 - 176, ⟨10.1007/978-3-662-55751-8_14⟩
Communication dans un congrès
hal-01616485v1
|
||
|
Cross-document pattern matchingCPM 2012, Jul 2012, Helsinki, Finland. pp.196-207, ⟨10.1007/978-3-642-31265-6_16⟩
Communication dans un congrès
hal-00789975v1
|
||
|
SIGffRid : Programme de recherche des sites de fixation des facteurs de transcription par approche comparativeJournées Ouvertes Biologie Informatique Mathématiques - JOBIM'05, Guy Perrière, Alain Guénoche et Christophe Geourjon, Jul 2005, Lyon, France. pp.417-425
Communication dans un congrès
inria-00000191v1
|
||
Prefix Table Construction and ConversionIWOCA, Jun 2013, Rouen, France. pp.41-53, ⟨10.1007/978-3-642-45278-9_5⟩
Communication dans un congrès
istex
hal-00824756v1
|
|||
|
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
|
||
|
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
|
||
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
|
|||
|
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
|
||
|
Rapid heuristic inference of antibiotic resistance and susceptibility by genomic neighbor typing2019
Pré-publication, Document de travail
hal-02414869v1
|
||
|
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
|
||
|
Dynamic read mapping and online consensus calling for better variant detection2016
Pré-publication, Document de travail
hal-01323188v1
|
||
|
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
|
||
|
A unifying framework for seed sensitivity and its application to subset seeds.Journal of Bioinformatics and Computational Biology, 2006, 4 (2), pp.553-69. ⟨10.1142/S0219720006001977⟩
Article dans une revue
hal-00018114v2
|
||
|
NORINE: a database of nonribosomal peptides.Nucleic Acids Research, 2008, Database issue, 36 (Database issue), pp.D326-31. ⟨10.1093/nar/gkm792⟩
Article dans une revue
inria-00281012v1
|
||
|
Multi-seed lossless filtrationIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2005, 2 (1), pp.51--61. ⟨10.1109/TCBB.2005.12⟩
Article dans une revue
inria-00000718v1
|
||
|
Finding approximate repetitions under Hamming distance[Research Report] RR-4163, INRIA. 2001, pp.30
Rapport
inria-00072459v1
|