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

W. Saurin

dblp:02/835 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 · 2 · 2 first-author

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
2 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
comparative genomics
0.011987
Repetitive palindromic sequences in Escherichia coli. Detection and characterization with a new computer program · Comput. Appl. Biosci. 1987
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
repeat detection
0.011987
Repetitive palindromic sequences in Escherichia coli. Detection and characterization with a new computer program · 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 › genomics › microbial genomics
bacterial genomics
0.011987
Repetitive palindromic sequences in Escherichia coli. Detection and characterization with a new computer program · 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

sequence analysis · 0.0pattern search · 0.0pattern matching · 0.0automatic demonstration · 0.0
YearPublicationVenuePosition
1987 Repetitive palindromic sequences in Escherichia coli. Detection and characterization with a new computer program
abstract
We have made use of a new computer program which rapidly searches for DNA patterns irrespective of the exact sequence, in order to search systematically for repetitive palindromic structures on the Escherichia coli chromosome. By using a relatively restrictive criterion, we detected three families of palindromic structures. One is present in ribosomal RNA operons. Since seven identical ribosomal RNA operons are found on the E. coli genome, this constitutes a validation of the method. Another family is constituted by the extragenic palindromic units (PUs or REP) already described (Gilson et al., 1984). We propose a slightly different consensus for this highly repetitive and dispersed family. The last is a subclass of symmetrical transcription termination sites which we have identified. They are present in four attenuator sites and at least one terminator for convergent operons. We suggest that these symmetrical terminator sites may play a general role in the termination of transcription for convergent operons. We discuss briefly how this type of approach could be used to analyse the structure of genomes.
W. Saurin
Comput. Appl. Biosci.1
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.1