A Context-Free Grammar is a formal grammar in which each production rule is of the form $ A \rightarrow \alpha $, where $ A $ is a single nonterminal symbol and $ \alpha $ is a string of terminals and nonterminals, distinguishing it from other types of grammars by allowing rule applications to be independent of the surrounding context.
907
Publications
67.5K
Citations
1.4K
Authors
556
Institutions
Publications per year
2017–2026
66
Publications
907
Rfam: annotating non-coding RNAs in complete genomes
Sam Griffiths‐Jones · Nucleic Acids Research · 2004 · 1.8K citations · Full text
1–5 of 907
Authors
1.4K
- GS
13
h-index
- MN
11
h-index
- YS
8
h-index
- AK
8
h-index
- YS
8
h-index
1–5 of 1.4K
Institutions
556
Carnegie Mellon University
Pittsburgh, United States
17 h-index
38 publications
3.4K citations
University of California, Berkeley
Berkeley, United States
17 h-index
33 publications
1.8K citations
Massachusetts Institute of Technology
Cambridge, United States
16 h-index
29 publications
4.6K citations
Stanford University
Stanford, United States
15 h-index
24 publications
3.4K citations
University of Pennsylvania
Philadelphia, United States
15 h-index
23 publications
1.9K citations
University of Edinburgh
Edinburgh, United Kingdom
14 h-index
24 publications
1.7K citations
University of Turku
Turku, Finland
13 h-index
16 publications
518 citations
University of Sussex
Brighton, United Kingdom
11 h-index
13 publications
1.1K citations
1–8 of 556
Venues
- Theoretical Computer Science
31 publications · 1.4K citations
17
h-index
- Journal of Computer and System Sciences
21 publications · 1K citations
15
h-index
- Journal of the ACM
JACM · 19 publications · 2.9K citations
15
h-index
- Information and Control
18 publications · 737 citations
14
h-index
- ACM SIGPLAN Notices
14 publications · 849 citations
13
h-index
1–5