新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

mmartin library [31 articles]

最近 mmartin さんのライブラリ .
  • Basic local alignment search tool.
    J Mol Biol, Vol. 215, No. 3. (5 October 1990), pp. 403-410.
    by SF Altschul, W Gish, W Miller, EW Myers, DJ Lipman
    posted to alignment by mmartin on 2008-10-01 11:33:10 as ** along with 45 people and 6 groups pwais tharris dmp camster davidng evaf dragonrez jwm jmeppley Ayest RMGraze ea yas balajis alexg indigoviolet moborg arcticrasta dullhunk dgront caporaso michC myui BioNica CitoJam rabio timflutre lusk cjeans incovoma beatrizfernandez wenhan jtomasch GustavoLacerda sgoetz siebertm ichbins81 jofiel Thaverkamp shung marti hervelequere ashaytan benwei granujilla C. elegans / WormBase dbk-lab EisenLab T_lab biomedical-nlp Microbial-Ecology
  • BLAT--the BLAST-like alignment tool.
    Genome Res, Vol. 12, No. 4. (April 2002), pp. 656-664.
    by WJ Kent
    posted to no-tag by mmartin on 2008-10-01 11:32:23 as ** along with 22 people and 1 group pwais umit paszkows operon miguel pcahan1 Ayest indigoviolet mtagaya treangen michC djkt timflutre olympos cjeans wenhan natstreet antonkratz yoanjacquemin talponer bozdagd gpappas EisenLab
  • SSAHA: A fast search method for large DNA databases
    Genome Res., Vol. 11, No. 10. (2001), pp. 1725-1729.
    by Z Ning, AJ Cox, JC Mullikin
    posted to no-tag by mmartin on 2008-10-01 11:31:42 as ** along with 6 people umit timflutre bpb j3xucite lp2 dmc
  • Efficient q-Gram Filters for Finding All e-Matches Over a Given Length
    (2005)
    by Kim Rasmussen, Jens Stoye, Eugene W Myers
    posted to qgram by mmartin on 2008-10-01 11:27:10 as ** along with 1 person timflutre
  • A faster and simpler fully dynamic transitive closure
    (2003), pp. 404-412.
    by Liam Roditty
    posted to graph by mmartin on 2007-03-09 18:12:43 as **
  • A simple min-cut algorithm
    Journal of the ACM, Vol. 44, No. 4. (July 1997), pp. 585-591.
    by Mechthild Stoer, Frank Wagner
    posted to mincut by mmartin on 2006-11-13 11:07:35 as ** along with 2 people chrisatcite ariels
  • An Experimental Study of Dynamic Algorithms for Transitive Closure
    J. Exp. Algorithmics, Vol. 6 (2001)
    by Daniele Frigioni, Tobias Miller, Christos Zaroliagis
    posted to no-tag by mmartin on 2006-11-04 20:52:01 as **
  • Sparsification—a technique for speeding up dynamic graph algorithms
    J. ACM, Vol. 44, No. 5. (September 1997), pp. 669-696.
    by David Eppstein, Zvi Galil, Giuseppe F Italiano, Amnon Nissenzweig
    posted to no-tag by mmartin on 2006-11-04 20:49:56 as ** along with 2 people ssn jrw
  • On the computational complexity of dynamic graph problems
    Theoretical Computer Science, Vol. 158, No. 1. (20 May 1996), pp. 233-277.
    by G Ramalingam, T Reps
    posted to no-tag by mmartin on 2006-11-04 20:48:37 as ** along with 1 person mplomer
  • A Dynamic Algorithm for Maintaining Graph Partitions
    (2000), pp. 71-82.
    by Lyudmil Aleksandrov, Hristo Djidjev
    posted to no-tag by mmartin on 2006-11-04 20:47:26 as ** along with 2 people and 4 groups jn euclid Algorithms metric_embeddings TCS Polytopes
  • Finding community structure in very large networks
    (30 August 2004)
    by Aaron Clauset, MEJ Newman, Cristopher Moore
    posted to no-tag by mmartin on 2006-10-11 12:57:59 as ** along with 31 people and 10 groups hubcite korakot cantupaz pdlug breyten momonga nkorf ldietz lfriedl skyebend kei_s bigbossman merazzle xpontus mattjb livingthingdan dbatorski azygmunt jiong jaspervoskuilen gaudan sparikh andreacapocci jmarcelino warner outlier marcio dpf apwesolowski ganden orahcio Philosophy_of_Information Blog_and_Wiki_Research kdl IS-Lab Semantic-Social-Networks ComplexAdaptiveSystems DSTO-CAS ilps livingthing AGH-IISG
  • Complexity classification of some edge modification problems
    Discrete Applied Mathematics, Vol. 113, No. 1. (30 September 2001), pp. 109-128.
    by Assaf Natanzon, Ron Shamir, Roded Sharan
    posted to no-tag by mmartin on 2006-10-06 14:19:51 as **
  • Cluster graph modification problems
    Discrete Appl. Math., Vol. 144, No. 1-2. (2004), pp. 173-182.
    by Ron Shamir, Roded Sharan, Dekel Tsur
    posted to no-tag by mmartin on 2006-09-28 13:28:16 as ** along with 2 people bigbossman rsantana
  • Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation
    Theory of Computing Systems, Vol. 38, No. 4. (2005), pp. 373-392.
    by Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    posted to no-tag by mmartin on 2006-09-27 14:58:39 as read
  • Collective dynamics of 'small-world' networks.
    Nature, Vol. 393, No. 6684. (4 June 1998), pp. 440-442.
    by Duncan J Watts, Steven H Strogatz
    posted to no-tag by mmartin on 2006-09-21 15:26:48 as read along with 75 people and 13 groups jmenche chrisdubois tharris MehdiMoussaid jobriath camster G_RAM kewms KAllendoerfer AdrianMiles mague alexisgallagher Rsavi zqshen shivaram cmmorel Shirakawa tolosoft nithya nygaard balicea dumpa matteodellamico yoh dullhunk voiklis eldaly ianturton merazzle maqbes muraken zono zeroknowledge choonpeng cerkut xinian king amac adriandefroment RafG radale jaspervoskuilen timflutre pbrandao sugaya ruvido rsantana cjeans fbaroni michaelmampaey rcrane ransombriggs suizan lpfernandes sbianco kb kaks stefanoallesina beete teferet ladamic iris_2001 livingthingdan jsanpedro jotwin ulmer takeha-e dylanwalker mpotamias jpbarrette Borelli jago ddahlem ilkert tomhebbron Network Data Repository C. elegans / WormBase dbk-lab GraphVis Semantic-Social-Networks microRNA Web2 Soslab CooperationStudies ColDyn contact-id ADMiRes 801
  • Minimum Cuts in Near-Linear Time
    J. ACM, Vol. 47, No. 1. (January 2000), pp. 46-76.
    by David R Karger
    posted to no-tag by mmartin on 2006-09-21 14:44:34 as **
  • An Algorithm for Clustering cDNA Fingerprints
    Genomics, Vol. 66, No. 3. (15 June 2000), pp. 249-256.
    by Erez Hartuv, Armin O Schmitt, Jorg Lange, Sebastian Meier-Ewert, Hans Lehrach, Ron Shamir
    posted to no-tag by mmartin on 2006-09-21 14:28:42 as ** along with 1 person ethkim
  • Finding Communities in Linear Time: A Physics Approach
    (26 Oct 2003)
    by Fang Wu, Bernardo A Huberman
    posted to no-tag by mmartin on 2006-09-18 12:25:53 as ** along with 1 person henningpeters
  • Dynamic Graph Algorithms
    (1997)
    by David Eppstein, Zvi Galil, Giuseppe F Italiano
    posted to no-tag by mmartin on 2006-09-18 12:13:21 as ** along with 7 people and 2 groups ansobol augusto BarrosH henningpeters gane5h azygmunt jaspervoskuilen AIRgroup AGH-IISG
  • Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
    Algorithmica, Vol. 39, No. 4. (2004), pp. 321-347.
    by Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    posted to no-tag by mmartin on 2006-09-15 16:29:19 as **
  • On the Approximability of Maximum and Minimum Edge Clique Partition Problems
    Vol. 51 (2006), pp. 101-105.
    by Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva M Lundell, Mia Persson
    edited by Joachim Gudmundsson, Barry Jay
    posted to no-tag by mmartin on 2006-09-15 16:27:01 as **
  • LGL: creating a map of protein function with an algorithm for visualizing very large biological networks.
    J Mol Biol, Vol. 340, No. 1. (25 June 2004), pp. 179-190.
    by AT Adai, SV Date, S Wieland, EM Marcotte
    posted to no-tag by mmartin on 2006-09-15 15:11:11 as read along with 3 people opheliav ganden svdate
  • Automatic Detection of Song Changes in Music Mixes Using Stochastic Models
    Vol. 3 (2006), pp. 665-668.
    by Thomas Plötz, Gernot A Fink, Peter Husemann, Sven Kanies, Kai Lienemann, Tobias Marschall, Marcel Martin, Lars Schillingmann, Matthias Steinrücken, Henner Sudek
    posted to no-tag by mmartin on 2006-09-15 15:05:10 as read along with 1 person lschilli
  • Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
    Theor. Comp. Sys., Vol. 38, No. 4. (2005), pp. 373-392.
    by Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    posted to no-tag by mmartin on 2006-09-15 15:02:35 as **
  • Finding All Maximal Cliques of a Family of Induced Subgraphs
    (December 2003)
    by Daniel Baum
    posted to no-tag by mmartin on 2006-09-15 14:56:21 as **
  • Algorithm 457: finding all cliques of an undirected graph
    Commun. ACM, Vol. 16, No. 9. (September 1973), pp. 575-577.
    by Coen Bron, Joep Kerbosch
    posted to no-tag by mmartin on 2006-09-15 14:37:05 as ** along with 4 people and 1 group BragilMassoud dragonrez nkorf simon_o Semantic-Social-Networks
  • Clustering with Qualitative Information
    focs, Vol. 00 (2003)
    by Moses Charikar, Venkatesan Guruswami, Anthony Wirth
    posted to no-tag by mmartin on 2006-09-15 14:34:52 as **
  • On the NP-Completeness of Some Graph Cluster Measures
    (29 Jun 2005)
    by Jiri Sima, Satu E Schaeffer
    posted to no-tag by mmartin on 2006-09-15 14:23:25 as ** along with 2 people trunov rocarvaj
  • A clustering algorithm based on graph connectivity
    Information Processing Letters, Vol. 76, No. 4--6. (2000), pp. 175-181.
    by Erez Hartuv, Ron Shamir
    posted to no-tag by mmartin on 2006-09-15 14:17:19 as read along with 17 people and 6 groups pdlug eme zqshen fsilvestri rahul srinaths Jaykul metamerist augusto petzlux mabbott balicea gane5h onyx gurkanbebek nklee maralena GraphVis astro InformationRetrieval SRL AIRgroup oktave-labs
  • Experiments on Graph Clustering Algorithms
    by Ulrik Brandes, Marco Gaertler, Dorothea Wagner
    posted to no-tag by mmartin on 2006-09-15 11:25:01 as ** along with 4 people and 1 group zqshen maralena jwhitney AbnerCYH GraphVis
  • Correlation Clustering with a Fixed Number of Clusters
    (6 Apr 2005)
    by Ioannis Giotis, Venkatesan Guruswami
    posted to no-tag by mmartin on 2006-09-15 11:19:25 as **
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/mmartin

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.