Refining causality: who copied from whom?
暂无分享,去创建一个
[1] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[2] A. Rbnyi. ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .
[3] Uzi Vishkin,et al. On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.
[4] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[5] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.
[6] Esko Ukkonen,et al. On-line construction of suffix trees , 1995, Algorithmica.
[7] B. Bollobás. The evolution of random graphs , 1984 .
[8] Nello Cristianini,et al. Inference and Validation of Networks , 2009, ECML/PKDD.
[9] Nello Cristianini,et al. Reconstruction of Causal Networks by Set Covering , 2011, ICANNGA.
[10] Florent Nicart,et al. A hard-disk based suffix tree implementation , 2011 .
[11] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.
[12] Jure Leskovec,et al. Inferring networks of diffusion and influence , 2010, KDD.
[13] Lada A. Adamic,et al. Tracking information epidemics in blogspace , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).
[14] Maxime Crochemore,et al. Algorithms on strings , 2007 .
[15] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[16] Jure Leskovec,et al. Meme-tracking and the dynamics of the news cycle , 2009, KDD.
[17] Béla Bollobás,et al. Directed scale-free graphs , 2003, SODA '03.
[18] P. Erdos,et al. On the evolution of random graphs , 1984 .
[19] Petr Slavík. Improved Performance of the Greedy Algorithm for Partial Cover , 1997, Inf. Process. Lett..