default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Coste
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Nicolas Buton
, François Coste, Yann Le Cunff:
Predicting enzymatic function of protein sequences with attention. Bioinform. 39(10) (2023)- [j9]Olivier Dennler, François Coste, Samuel Blanquart, Catherine Belleannée, Nathalie Théret:
Phylogenetic inference of the emergence of sequence modules and protein-protein interactions in the ADAMTS-TSL family. PLoS Comput. Biol. 19(8) (2023) - [e2]François Coste, Faissal Ouardi, Guillaume Rabusseau:
International Conference on Grammatical Inference, ICGI 2023, 10-13 July 2023, Rabat, Morocco. Proceedings of Machine Learning Research 217, PMLR 2023 [contents] - 2021
- [j8]Hugo Talibart, François Coste:
PPalign: optimal alignment of Potts models representing proteins with direct coupling information. BMC Bioinform. 22(1): 317 (2021)
2010 – 2019
- 2019
- [i3]François Coste:
Deep learning languages: a key fundamental shift from probabilities to weights? CoRR abs/1908.00785 (2019) - 2018
- [c15]Mateusz Pyzik, François Coste, Witold Dyrka:
How to measure the topological quality of protein parse trees? ICGI 2018: 118-138 - [c14]François Coste, Jacques Nicolas:
Learning local substitutable context-free languages from positive examples in polynomial time and data by reduction. ICGI 2018: 155-168 - [i2]Witold Dyrka, François Coste, Juliette Talibart:
Estimating probabilistic context-free grammars for proteins using contact map constraints. CoRR abs/1805.08630 (2018) - 2016
- [j7]Clovis Galiez, Christophe N. Magnan, François Coste, Pierre Baldi:
VIRALpro: a tool to identify viral capsid and tail sequences. Bioinform. 32(9): 1405-1407 (2016) - [i1]Witold Dyrka, François Coste, Olgierd Unold, Lukasz Culer, Agnieszka Kaczmarek:
How to measure the topological quality of protein grammars? CoRR abs/1611.10078 (2016) - 2015
- [j6]Clovis Galiez, François Coste:
Amplitude spectrum distance: measuring the global shape divergence of protein fragments. BMC Bioinform. 16: 256:1-256:16 (2015) - 2014
- [c13]François Coste, Gaëlle Garet, Agnès Groisillier, Jacques Nicolas, Thierry Tonon:
Automated Enzyme Classification by Formal Concept Analysis. ICFCA 2014: 235-250 - [c12]François Coste, Gaëlle Garet, Jacques Nicolas:
A bottom-up efficient algorithm learning substitutable languages from positive examples. ICGI 2014: 49-63 - 2013
- [j5]Anthony Bretaudeau, François Coste, Florian Humily, Laurence Garczarek, Gildas Le Corguillé, Christophe Six, Morgane Ratin, Olivier Collin, Wendy M. Schluchter, Frédéric Partensky:
CyanoLyase: a database of phycobilin lyase sequences, motifs and functions. Nucleic Acids Res. 41(Database-Issue): 396-401 (2013) - 2012
- [j4]Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López:
Searching for smallest grammars on large sequences and application to DNA. J. Discrete Algorithms 11: 62-72 (2012) - [c11]François Coste, Gaëlle Garet, Jacques Nicolas:
Locally Substitutable Languages for Enhanced Inductive Leaps. ICGI 2012: 97-111 - 2011
- [j3]Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López:
The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing. Algorithms 4(4): 262-284 (2011) - 2010
- [c10]Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López:
Choosing Word Occurrences for the Smallest Grammar Problem. LATA 2010: 154-165
2000 – 2009
- 2009
- [j2]Matthias Gallé, Pierre Peterlongo, François Coste:
In-Place Update of Suffix Array while Recoding Words. Int. J. Found. Comput. Sci. 20(6): 1025-1045 (2009) - 2008
- [c9]Matthias Gallé, Pierre Peterlongo, François Coste:
In-place Update of Suffix Array while Recoding Words. Stringology 2008: 54-67 - [e1]Alexander Clark, François Coste, Laurent Miclet:
Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008, Proceedings. Lecture Notes in Computer Science 5278, Springer 2008, ISBN 978-3-540-88008-0 [contents] - 2005
- [j1]Bradford Starkie, François Coste, Menno van Zaanen:
Progressing the state-of-the-art in grammatical inference by competition: The Omphalos Context-Free Language Learning Competition. AI Commun. 18(2): 93-115 (2005) - [c8]François Coste, Goulven Kerbellec:
A Similar Fragments Merging Approach to Learn Automata on Proteins. ECML 2005: 522-529 - 2004
- [c7]Bradford Starkie, François Coste, Menno van Zaanen:
The Omphalos Context-Free Grammar Learning Competition. ICGI 2004: 16-27 - [c6]John Abela, François Coste, Sandro Spina:
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA. ICGI 2004: 28-39 - [c5]François Coste, Daniel Fredouille, Christopher Kermorvant, Colin de la Higuera:
Introducing Domain and Typing Bias in Automata Inference. ICGI 2004: 115-126 - 2003
- [c4]François Coste, Daniel Fredouille:
Unambiguous Automata Inference by Means of State-Merging Methods. ECML 2003: 60-71 - 2000
- [c3]François Coste, Daniel Fredouille:
Efficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic Automata. ICGI 2000: 25-38
1990 – 1999
- 1998
- [c2]François Coste, Jacques Nicolas:
Inference of Finite Automata: Reducing the Search Space with an Ordering of Pairs of States. ECML 1998: 37-42 - [c1]François Coste, Jacques Nicolas:
How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree. ICGI 1998: 199-210
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
