Anselm Blumer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2024

Fast Approximate IsoRank for Scalable Global Alignment of Biological NetworksKapil Devkota, Anselm Blumer, Xiaozhe Hu, Lenore Cowen. recomb 2024: 1-16 [doi]

Approximate IsoRank for Scalable and Functionally Meaningful Cross-Species Alignments of Protein Interaction NetworksKapil Devkota, Anselm Blumer, Xiaozhe Hu, Lenore Cowen. jcb, 31(10):990-1007, 2024. [doi]

2011

Connectedness of PPI network neighborhoods identifies regulatory hub proteinsAndrew D. Fox, Benjamin J. Hescott, Anselm Blumer, Donna K. Slonim. bioinformatics, 27(8):1135-1142, 2011. [doi]

2006

An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centralityJeongah Yoon, Anselm Blumer, Kyongbum Lee. bioinformatics, 22(24):3106-3108, 2006. [doi]

1989

Learning faster than promised by the Vapnik-Chervonenkis dimensionAnselm Blumer, Nick Littlestone. DAM, 24(1-3):47-53, 1989. [doi]

Learnability and the Vapnik-Chervonenkis dimensionAnselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth. JACM, 36(4):929-965, 1989. [doi]

Average sizes of suffix trees and DAWGsAnselm Blumer, Andrzej Ehrenfeucht, David Haussler. DAM, 24(1-3):37-45, 1989. [doi]

1988

The Rényi redundancy of generalized Huffman codesAnselm Blumer, Robert J. McEliece. TIT, 34(5):1242-1249, 1988.

1987

Minimax universal noiseless coding for unifilar and Markov sourcesAnselm Blumer. TIT, 33(6):925, 1987.

Complete inverted files for efficient text retrieval and analysisAnselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht. JACM, 34(3):578-595, 1987. [doi]

Occam s RazorAnselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth. ipl, 24(6):377-380, 1987.

1986

Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract)Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth. stoc 1986: 273-282

1985

The Smallest Automaton Recognizing the Subwords of a TextAnselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas. TCS, 40:31-55, 1985.

1984

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear TimeAnselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell. icalp 1984: 109-118

Building a Complete Inverted File for a Set of Text Files in Linear TimeAnselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell. stoc 1984: 349-358

1983

Linear size finite automata for the set of all subwords of a word - an outline of resultsAnselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell. eatcs, 21:12-20, 1983.

Sign in or sign up to see more results.

runs on WebDSL

翻译：