A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text

GARCIA-HERNANDEZ R A; MARTINEZ-TRINIDAD J F; CARRASCO-OCHOA J A

Art

J-GLOBAL ID：200902212386555698 Reference number：05A0311048

A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text

テキスト中の最頻出シーケンスを全て発見するための高速なアルゴリズム

Publisher site Copy service {{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=05A0311048&COPY=1") }}
Access JDreamⅢ for advanced search and analysis. {{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=05A0311048&from=J-GLOBAL&jstjournalNo=H0078D") }}

Author (3)： , ,
Material：
Volume： 3287 Page： 478-486 Publication year： 2004
JST Material Number： H0078D ISSN： 0302-9743 Document type： Proceedings
Country of issue： Germany, Federal Republic of (DEU) Language： ENGLISH (EN)

, ,

Return to Previous Page