default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Myers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j7]Timothy Dallman, Philip Ashton, Ulf Schafer, Aleksey Jironkin, Anais Painset
, Sharif Shaaban, Hassan Hartman, Richard Myers, Anthony Underwood, Claire Jenkins, Kathie Grant:
SnapperDB: a database solution for routine sequencing analysis of bacterial isolates. Bioinform. 34(17): 3028-3029 (2018)
2000 – 2009
- 2008
- [c9]Nathan Griffiths, Arshad Jhumka, Anthony Dawson, Richard Myers:
A Simple Trust model for On-Demand Routing in Mobile Ad-Hoc Networks. IDC 2008: 105-114 - 2004
- [c8]Richard Myers, Catherine V. Gale, Caroline Clark, Julie Bennett, Richard S. Tedder, Ian G. Williams, Paul Kellam:
The Novel Virus Genotyping Tool (STAR) and its Use in Subtyping Human Immunodeficiency Virus Type-1 and Hepatitis B Viruses. Spanish Bioinformatics Conference 2004: 44 - 2001
- [j6]Richard Myers, Edwin R. Hancock:
Empirical Modelling of Genetic Algorithms. Evol. Comput. 9(4): 461-493 (2001) - [j5]Richard Myers, Edwin R. Hancock:
Least-commitment graph matching with genetic algorithms. Pattern Recognit. 34(2): 375-394 (2001) - 2000
- [j4]Richard Myers, Richard C. Wilson, Edwin R. Hancock:
Bayesian Graph Edit Distance. IEEE Trans. Pattern Anal. Mach. Intell. 22(6): 628-635 (2000) - [j3]Richard Myers, Edwin R. Hancock:
Genetic algorithms for ambiguous labelling problems. Pattern Recognit. 33(4): 685-704 (2000) - [j2]Andrew D. J. Cross, Richard Myers, Edwin R. Hancock:
Convergence of a hill-climbing genetic algorithm for graph matching. Pattern Recognit. 33(11): 1863-1880 (2000) - [c7]Richard Myers, Edwin R. Hancock:
Least Committment Graph Matching by Evolutionary Optimisation. ECCV (1) 2000: 203-219 - [c6]Paolo Bergamini, Luigi Cinque, Andrew D. J. Cross, Edwin R. Hancock, Stefano Levialdi, Richard Myers:
Efficient Alignment and Correspondence Using Edit Distance. SSPR/SPR 2000: 246-255 - [c5]Richard Myers, Edwin R. Hancock:
Selection Strategies for Ambiguous Graph Matching by Evolutionary Optimisation. SSPR/SPR 2000: 397-406
1990 – 1999
- 1999
- [c4]Richard Myers, Richard C. Wilson, Edwin R. Hancock:
Bayesian Graph Edit Distance. ICIAP 1999: 1166-1171 - 1998
- [c3]Richard Myers, Richard C. Wilson, Edwin R. Hancock:
Efficient relational matching with local edit distance. ICPR 1998: 1711-1714 - [c2]Richard Myers, Edwin R. Hancock:
Genetic Algorithms for Structural Editing. SSPR/SPR 1998: 159-168 - 1997
- [j1]Richard Myers, Edwin R. Hancock:
Genetic algorithm parameter sets for line labelling. Pattern Recognit. Lett. 18(11-13): 1363-1371 (1997) - [c1]Richard Myers, Edwin R. Hancock:
Genetic Algorithms for Ambiguous Labelling Problems. EMMCVPR 1997: 345-360
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-25 05:52 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:
