Incremental discovery of irredundant motif bases in time O(|Σ|n2 log n) (Extended abstract)

被引：0

作者：

Apostolico, Alberto ^{[1
]}

Tagliacollo, Claudia

机构：

[1] Georgia Inst Technol, Atlanta, GA 30332 USA

[2] Univ Padua, I-35100 Padua, Italy

来源：

ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS | 2007年 / 4645卷

关键词：

D O I：

暂无

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：136 / 148

页数：13

共 50 条

[1] Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2 log n) time
Apostolico, Alberto
Tagliacollo, Claudia
THEORETICAL COMPUTER SCIENCE, 2008, 408 (2-3) : 106 - 115
[2] A O(n log2 n) Checker and O(n2 log n) Filtering Algorithm for the Energetic Reasoning
Ouellet, Yanick
Quimper, Claude-Guy
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018, 2018, 10848 : 477 - 494
[3] A SHORTEST-PATH ALGORITHM WITH EXPECTED TIME O(N2 LOG N LOGSTAR N)
BLONIARZ, PA
SIAM JOURNAL ON COMPUTING, 1983, 12 (03) : 588 - 600
[4] O(√log n) APPROXIMATION TO SPARSEST CUT IN (O)over-bar(n2) TIME
Arora, Sanjeev
Hazan, Elad
Kale, Satyen
SIAM JOURNAL ON COMPUTING, 2010, 39 (05) : 1748 - 1771
[5] O(√log n) approximation to SPARSEST CUT in (O)over-tilde(n2) time
Arora, S
Hazan, E
Kale, S
45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 238 - 247
[6] A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)
Poli, A.
Journal of Symbolic Computation, 19 (04):
[7] A simplified algorithm for the all pairs shortest path problem with O(n2 log n) expected time
Takaoka, Tadao
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (02) : 326 - 337
[8] An O(n2 log n) time algorithm for computing shortest paths amidst growing discs in the plane
Maheshwari, Anil
Nussbaum, Doron
Sack, Joerg-Ruediger
Yi, Jiehua
ALGORITHMS AND COMPUTATION, 2007, 4835 : 668 - 680
[9] On-line construction of two-dimensional suffix trees in O(n2 log n) time
Na, Joong Chae
Giancarlo, Raffaele
Park, Kunsoo
ALGORITHMICA, 2007, 48 (02) : 173 - 186
[10] A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2 log n) Expected Time
Takaoka, Tadao
Hashim, Mashitoh
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 195 - 206

← 1 2 3 4 5 →