Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Takuo Tanemura
Cai Xi
Claudia Calabrese
Maria Concetta Palumbo
Jhonathan Pinzon
Athanasios Skevis
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
E RIVALS
Author Info
Open Visualization
Name
Affiliation
Papers
E RIVALS
Deutsch Krebsforschungszentrum, D-69120 Heidelberg, Germany
14
Collaborators
Citations
PageRank
8
13
6.29
Referers
Referees
References
25
99
72
Publications (14 rows)
Collaborators (8 rows)
Referers (25 rows)
Referees (99 rows)
Title
Citations
PageRank
Year
Hierarchical Overlap Graph
0
0.34
2020
Efficient Construction of Hierarchical Overlap Graphs.
0
0.34
2020
Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding.
0
0.34
2019
Relationship between superstring and compression measures: New insights on the greedy conjecture.
0
0.34
2018
Superstrings with multiplicities.
0
0.34
2018
Practical lower and upper bounds for the Shortest Linear Superstring.
0
0.34
2018
Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding.
0
0.34
2018
A linear time algorithm for Shortest Cyclic Cover of Strings.
1
0.37
2016
Superstring Graph: A New Approach for Genome Assembly.
1
0.34
2016
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings
3
0.42
2016
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree.
0
0.34
2015
Reverse engineering of compact suffix trees and links: A novel algorithm.
1
0.36
2014
Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings.
3
0.41
2014
Computational Approaches To Identify Leucine Zippers
4
1.70
1998
1