Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

P. Marliere

dblp:79/115 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
pattern matching		 0.011987
Matching relational patterns in nucleic acid sequences · Comput. Appl. Biosci. 1987
Bioinformatics and computational biology
sequence analysis		 0.011987
Matching relational patterns in nucleic acid sequences · Comput. Appl. Biosci. 1987
Bioinformatics and computational biology › sequence analysis › sequence similarity search
sequence database search		 0.011987
Matching relational patterns in nucleic acid sequences · Comput. Appl. Biosci. 1987

Methods — techniques the papers use, named apart from their topics

pattern matching · 0.0automatic demonstration · 0.0
YearPublicationVenuePosition
1987 Matching relational patterns in nucleic acid sequences
abstract
We describe a program that efficiently searches sequence data banks for complex patterns where sites are linked by common relations such as identity, complementarity or span. Its algorithm is closer to those of automatic demonstration than to the finite state machines used in fast pattern matching. The repertory of relations can be enriched at will without rewriting the core of the program. The program is written in Pascal-ISO and runs on a microcomputer.
W. Saurin, P. Marliere
 Comput. Appl. Biosci.2