Pattern discovery on character sets and real-valued data: Linear bound on irredundant motifs and an efficient polynomial time algorithm

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 297-308

  Parida, Laxmi ^a   Rigoutsos, Isidore ^a   Floratos, Aris ^a   Platt, Dan ^a   Gao, Yuan ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; POLYNOMIALS;

IRREDUNDANT MOTIFS; POLYNOMIAL TIME ALGORITHMS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0033886876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)