François Coste
Orcid: 0000-0001-9134-6557
According to our database1,
François Coste
authored at least 27 papers
between 1998 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Bioinform., October, 2023
Phylogenetic inference of the emergence of sequence modules and protein-protein interactions in the ADAMTS-TSL family.
PLoS Comput. Biol., 2023
2021
PPalign: optimal alignment of Potts models representing proteins with direct coupling information.
BMC Bioinform., 2021
2019
CoRR, 2019
2018
Estimating probabilistic context-free grammars for proteins using contact map constraints.
CoRR, 2018
Proceedings of the 14th International Conference on Grammatical Inference, 2018
Learning local substitutable context-free languages from positive examples in polynomial time and data by reduction.
Proceedings of the 14th International Conference on Grammatical Inference, 2018
2016
2015
Amplitude spectrum distance: measuring the global shape divergence of protein fragments.
BMC Bioinform., 2015
2014
A bottom-up efficient algorithm learning substitutable languages from positive examples.
Proceedings of the 12th International Conference on Grammatical Inference, 2014
Proceedings of the Formal Concept Analysis - 12th International Conference, 2014
2013
Nucleic Acids Res., 2013
2012
Proceedings of the Eleventh International Conference on Grammatical Inference, 2012
J. Discrete Algorithms, 2012
2011
Algorithms, 2011
2010
Proceedings of the Language and Automata Theory and Applications, 2010
2009
Int. J. Found. Comput. Sci., 2009
2005
Progressing the state-of-the-art in grammatical inference by competition: The Omphalos Context-Free Language Learning Competition.
AI Commun., 2005
Proceedings of the Machine Learning: ECML 2005, 2005
2004
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004
2003
Proceedings of the Machine Learning: ECML 2003, 2003
2000
Efficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic Automata.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000
1998
How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree.
Proceedings of the Grammatical Inference, 4th International Colloquium, 1998
Inference of Finite Automata: Reducing the Search Space with an Ordering of Pairs of States.
Proceedings of the Machine Learning: ECML-98, 1998