François Coste

According to our database1, François Coste authored at least 24 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Deep learning languages: a key fundamental shift from probabilities to weights?
CoRR, 2019

2018
Estimating probabilistic context-free grammars for proteins using contact map constraints.
CoRR, 2018

How to measure the topological quality of protein parse trees?
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
How to measure the topological quality of protein grammars?
CoRR, 2016

VIRALpro: a tool to identify viral capsid and tail sequences.
Bioinform., 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

Automated Enzyme Classification by Formal Concept Analysis.
Proceedings of the Formal Concept Analysis - 12th International Conference, 2014

2013
CyanoLyase: a database of phycobilin lyase sequences, motifs and functions.
Nucleic Acids Res., 2013

2012
Locally Substitutable Languages for Enhanced Inductive Leaps.
Proceedings of the Eleventh International Conference on Grammatical Inference, 2012

Searching for smallest grammars on large sequences and application to DNA.
J. Discrete Algorithms, 2012

2011
The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing.
Algorithms, 2011

2010
Choosing Word Occurrences for the Smallest Grammar Problem.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
In-Place Update of Suffix Array while Recoding Words.
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

A Similar Fragments Merging Approach to Learn Automata on Proteins.
Proceedings of the Machine Learning: ECML 2005, 2005

2004
The Omphalos Context-Free Grammar Learning Competition.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

Introducing Domain and Typing Bias in Automata Inference.
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
Unambiguous Automata Inference by Means of State-Merging Methods.
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


  Loading...