default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Michel Richer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c10]Karla Esmeralda Vazquez Ortiz, Jean-Michel Richer, David Lesaint:
Strategies for Phylogenetic Reconstruction - For the Maximum Parsimony Problem. BIOINFORMATICS 2016: 226-236- 2015
- [j3]Xing-Ming Zhao, Keqin Liu, Guanghui Zhu, Feng He, Béatrice Duval, Jean-Michel Richer, De-Shuang Huang, Changjun Jiang, Jin-Kao Hao, Luonan Chen:
Identifying cancer-related microRNAs based on gene expression data. Bioinform. 31(8): 1226-1234 (2015) - 2014
- [c9]Karla Esmeralda Vazquez Ortiz, Jean-Michel Richer, David Lesaint, Eduardo Rodriguez-Tello
:
A bottom-up implementation of Path-Relinking for Phylogenetic reconstruction applied to Maximum Parsimony. MCDM 2014: 157-163 - 2013
- [j2]Xiujun Zhang, Keqin Liu, Zhi-Ping Liu, Béatrice Duval, Jean-Michel Richer, Xing-Ming Zhao, Jin-Kao Hao, Luonan Chen:
NARROMI: a noise and redundancy reduction technique improves accuracy of gene regulatory network inference. Bioinform. 29(1): 106-113 (2013) - 2012
- [c8]Jean-Michel Richer, Eduardo Rodriguez-Tello, Karla Esmeralda Vazquez Ortiz:
Maximum Parsimony Phylogenetic Inference Using Simulated Annealing. EVOLVE 2012: 189-203
2000 – 2009
- 2009
- [c7]Jean-Michel Richer, Adrien Goëffon, Jin-Kao Hao:
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony. EvoBIO 2009: 164-175 - 2008
- [j1]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 5(1): 136-145 (2008) - 2007
- [c6]Jean-Michel Richer, Vincent Derrien, Jin-Kao Hao:
A New Dynamic Programming Algorithm for Multiple Sequence Alignment. COCOA 2007: 52-61 - 2006
- [c5]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem. PPSN 2006: 761-770 - 2005
- [c4]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
Local Search for the Maximum Parsimony Problem. ICNC (3) 2005: 678-683
1990 – 1999
- 1999
- [c3]Jean-Michel Richer, Jean-Jacques Chabrier:
Sacre: a Constraint Satisfaction Problem Based Theorem Prover. AAAI/IAAI 1999: 306-311 - 1997
- [c2]Jean-Michel Richer, Jean-Jacques Chabrier:
Une approche de résolution de problèmes en logique basée sur des techniques de satisfaction de contraintes. JFPLC 1997: 245-260 - 1995
- [c1]Jacqueline Chabrier, Vincent Juliard, Jean-Michel Richer:
SCORE(FD/B) : résolution de problèmes SAT aléatoires et structurés. JFPLC 1995: 361-364
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-04-24 23:16 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:
