Subject Index. Journal of Discrete Algorithms 5 (2007)

Transcription

1 Journal of Discrete Algorithms 5 (2007) Subject Index Ad hoc and wireless networks Ad hoc networks Admission control Algorithm ; ; A simple fast hybrid pattern-matching algorithm, 682 Algorithm design Algorithms Parameterized matching with mismatches, 135; Algorithms for computing parameters of graph-based extensions of BCH codes, 553; Analysis of algorithm Analysis of algorithms Approximate string matching Efficient generation of super condensed neighborhoods, 501 Approximation algorithm On-line load balancing made simple: Greedy strikes back, 162; ; Approximation algorithms ; On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours, 102; Cut problems in graphs with a budget constraint, 262; Approximating the k-traveling repairman problem with repairtimes, 293; Approximating Huffman codes in parallel, 479; Admission control with advance reservations in simple networks, ; Exploiting locality: approximating sorting buffers, 729 Arithmetic operation Average-case Axis parallel rectangles Bin packing problem Binary gcd algorithm Binomial identities HyperQuick algorithm for discrete hypergeometric distribution, 341 Biological weighted sequences Algorithms for extracting motifs from biological weighted sequences, 229 Bit-manipulation algorithms Broadcasting Broadcasting in geometric radio 87 Budget problems Cache placement problem Character sets Circular arc containment graphs Circular genomes Codes Algorithms for computing parameters of graph-based extensions of BCH codes, 553 Combinatorial algorithms on words Combinatorial computer vision Combinatorial optimization ; Approximating the k-traveling repairman problem with repairtimes, 293 Combinatorics Communication Communication complexity Comparative genomics /2007 Published by Elsevier B.V. doi: /s (07)

2 752 Subject Index / Journal of Discrete Algorithms 5 (2007) ; A linear time algorithm for the inversion median problem in circular Competitive analysis Complexity Real roots of univariate polynomials and straight line programs, 471; Computational biology ; Comparing similar ordered trees in linear-time, 696 Computational complexity On-line load balancing made simple: Greedy strikes back, 162; On the complexity of Jensen s algorithm for counting fixed polyominoes, 348; An upper bound on the hardness of exact matrix based motif discovery, Contraction method Convex fan Convexity Coupling CSMA/CA Cut problems Data structures A note on data structures for maintaining bipartitions, 129 Design and analysis of algorithms Difference constraints Directed graphs Algorithms for computing parameters of graph-based extensions of BCH codes, 553 Disk architecture Distance-edge-coloring Divide-and-conquer algorithm Dominating sets Dynamic programming ; Computing the maximum clique in the visibility graph of a simple polygon, 524; Edit distance Efficient generation of super condensed neighborhoods, 501; Text indexing with errors, 662; Comparing similar ordered trees in linear-time, 696 Edit-distance Erasure resilient code Error-correcting code Euler differential equation Exact Exact/approximation algorithms Fingerprints Finite automaton Fixed point Fragment statistics Frequency Function matching Generalized function matching, 514 Game theory Generalized suffix tree Linear time algorithm for the longest common repeat problem, 243 Generating function Genome rearrangements Geometric algorithms On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours, 102 Geometric routing Global alignment Graph algorithms Graph coloring ; On the minimum load coloring problem, 533 Graph partitioning On the minimum load coloring problem, 533 Graph theory Grid graph Hamiltonian cycle Hidden vertex set

3 Subject Index / Journal of Discrete Algorithms 5 (2007) Homographic Hub location Huffman codes Approximating Huffman codes in parallel, 479 Hypergeometric distribution HyperQuick algorithm for discrete hypergeometric distribution, 341 Information retrieval Inversions Inverted files Involution Isomorphism and refinement relations Knowledge radius Broadcasting in geometric radio 87 Label Cover Lattice animals On the complexity of Jensen s algorithm for counting fixed polyominoes, 348 Lecturer-optimal Levenshtein distance Linear-time algorithm Load balancing On-line load balancing made simple: Greedy strikes back, 162 Local algorithms Local edition Local ratio Local vertex coloring Local-ratio Exploiting locality: approximating sorting buffers, 729 Localization Longest common substring (LCS) Longest Hamiltonian cycle On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours, 102 MANET Markov chain Markov chain Monte Carlo Mass spectrometry Max-Rep problem Maximum clique Maximum integer multiflow Median problem Memory constraint Metric facility location Minimum multicut Monte Carlo sampling Motif discovery Motif extraction Algorithms for extracting motifs from biological weighted sequences, 229 Multilinear Multiple patterns Natural language processing Negative cost cycles Network design Node-connectivity augmentation NP-complete NP-completeness NP-hard Generalized function matching, 514 On-line algorithm On-line load balancing made simple: Greedy strikes back, 162 Online algorithms Optimal leaf ordering

4 754 Subject Index / Journal of Discrete Algorithms 5 (2007) Ordered labeled trees Ordered trees Comparing similar ordered trees in linear-time, 696 Overlaps Parallel algorithms Approximating Huffman codes in parallel, 479 Parameterized matching Parameterized matching with mismatches, 135; Generalized function matching, 514 Parity check matrix Partial k-trees Particle filter Path coupling PATRICIA tree Pattern matching Parameterized matching with mismatches, 135; Searching for a set of correlated patterns, 149; Efficient one-dimensional real scaled matching, 205; Generalized function matching, 514; Regular expression constrained sequence alignment, 647 Pattern matching with mismatches Parameterized matching with mismatches, 135 Pattern-matching A simple fast hybrid pattern-matching algorithm, 682 Periodicity Permutation Permutations Planar graphs Polyhedra Polyominoes On the complexity of Jensen s algorithm for counting fixed polyominoes, 348 Preference lists Protein identification Quadratic Quantum arithmetic protocol Quicksort Quotiented graph Radio network Broadcasting in geometric radio 87 Radio networks Railway optimization Rational Real roots Real roots of univariate polynomials and straight line programs, 471 Real scales Recursive equation Red-Blue Set Cover Regular expression Relaxing, zero-space Repeat Linear time algorithm for the longest common repeat problem, 243 Reversal distance Ring RNA local motifs RNA pattern matching Routing ; Scaled matching Scheduling Sensor networks ; Location tracking in mobile ad hoc networks using particle filters, Sequence alignment Sequence/structure alignments Shortest paths Shredders Simple polygon Sorting algorithm

5 Subject Index / Journal of Discrete Algorithms 5 (2007) Sorting buffers Exploiting locality: approximating sorting buffers, 729 Stable matching problem Steiner trees Stern Brocot Stochastic fixed point equation Straight line program Real roots of univariate polynomials and straight line programs, 471 Stressing String A simple fast hybrid pattern-matching algorithm, 682; Two-pattern strings II frequency of occurrence and substring complexity, 739 String algorithm Linear time algorithm for the longest common repeat problem, 243; String matching Parameterized matching with mismatches, 135 Student-optimal Sturmian Succinct data structures Suffix array Suffix tree Suffix trees ; Efficient generation of super condensed neighborhoods, 501 Supertrees Text indexing Tf idf Transcription factor binding site prediction Trees Trie Two-pattern Untrusted computation Visibility graph Wavelength assignment Wireless broadcast Wireless LAN Wireless sensor network Word A simple fast hybrid pattern-matching algorithm, 682 zero-space