String Algorithms For Bioinformatics
String Algorithms for Bioinformatics is a specialized branch of algorithmic research that focuses on the design and analysis of string-processing methods tailored to address computational challenges in biological sequence data, such as genome assembly, sequence alignment, and pattern discovery.
211
Publications
15K
Citations
531
Authors
274
Institutions
Publications per year
2017–2026
27
Parents
211
Reducing storage requirements for biological sequence comparison
Michael Roberts, Wayne B. Hayes, Brian R. Hunt et al. · Bioinformatics · 2004 · 587 citations · Full text
The fragment assembly string graph
Eugene W. Myers · Bioinformatics · 2005 · 446 citations
Applied Combinatorics on Words
M. Lothaire · Cambridge University Press eBooks · 2005 · 400 citations
1–5 of 211
531
6
h-index
5
h-index
4
h-index
3
h-index
3
h-index
1–5 of 531
274

University of Helsinki
Helsinki, Finland
7 h-index
14 publications
359 citations
University of Chile
Santiago, Chile
6 h-index
7 publications
279 citations
King's College London
London, United Kingdom
6 h-index
8 publications
193 citations
University of California, Berkeley
Berkeley, United States
5 h-index
6 publications
779 citations

University of Waterloo
Waterloo, Canada
5 h-index
6 publications
268 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
7 publications
524 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
15 publications
918 citations
The University of Tokyo
Tokyo, Japan
4 h-index
12 publications
172 citations
1–8 of 274
29 publications · 7.4K citations
20
h-index
11 publications · 624 citations
11
h-index
7 publications · 294 citations
7
h-index
6 publications · 198 citations
6
h-index
Repository · 6 publications · 197 citations
6
h-index
1–5