Share This Author
Average Case Analysis of Algorithms on Sequences
- W. Szpankowski
- Computer Science, Economics
- 16 April 2001
This book provides a unique overview of the tools and techniques used in average case analysis of algorithms.
Pairwise Alignment of Protein Interaction Networks
- Mehmet Koyutürk, Yohan Kim, Umut Topkara, S. Subramaniam, W. Szpankowski, A. Grama
- Computer Science, BiologyJ. Comput. Biol.
- 5 April 2006
This paper develops a framework for comprehensive alignment of PPI networks, inspired by duplication/divergence models that focus on understanding the evolution of protein interactions, and proposes a mathematical model that extends the concepts of match, mismatch, and gap in sequence alignment to that of match and duplication in network alignment and evaluates similarity between graph structures through a scoring function that accounts for evolutionary events.
Analytical Depoissonization and its Applications
Stability conditions for some distributed systems: buffered random access systems
- W. Szpankowski
- Mathematics, Computer ScienceAdvances in Applied Probability
- 1 June 1994
This paper proves necessary and sufficient conditions for stability of the ALOHA system by means of a novel technique based on three simple observations: applying mathematical induction to a smaller copy of the system, isolating a single queue for which Loynes' stability criteria is adopted, and using stochastic dominance to verify the required stationarity assumptions in the Loyne criterion.
An efficient algorithm for detecting frequent subgraphs in biological networks
An innovative new algorithm for detecting frequently occurring patterns and modules in biological networks is presented, using an innovative graph simplification technique, which is ideally suited to biological networks.
Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
This paper proposes a two-stage compression algorithm that asymptotically achieves the structural entropy up to the nlog term (i.e., the first two leading terms) of theStructural entropy of G(n,p) is (n;2)h(p)-logn!+o(1)-nlog+O(n), which is the first provable (asymptotical) optimal graph compressor for Erdónyi graph models.
On Pattern Frequency Occurrences in a Markovian Sequence
exact and asymptotic formulae for moments, probability of r pattern occurrences for three different regions of r, namely: (i) r=O(1) , (ii) central limit regime, and (iii) large deviations regime are presented.
Analysis of digital tries with Markovian dependency
A complete characterization of a digital tree is presented from the depth viewpoint in a Markovian framework, that is, under the assumption that symbols in a key are Markov-dependent, and shows that D/sub n/ tends to the normal distribution in all cases except the symmetric independent model.
A suboptimal lossy data compression based on approximate pattern matching
For stationary mixing sequences, the problem investigated by Steinberg and Gutman by showing that a lossy extension of the Wyner-Ziv (1989) scheme cannot be optimal is settled, and the asymptotic behavior of the so-called approximate waiting time N/sub l/ is established.