[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Bradford et al., 1991 - Google Patents

On the inadequacy of tournament algorithms for the N-SCS problem

Bradford et al., 1991

Document ID
14953639762535456737
Author
Bradford J
Jenkyns T
Publication year
Publication venue
Information Processing Letters

External Links

Snippet

It has been asserted in the literature that tournament algorithms may be used to solve the problem of finding a shortest common supersequence for a given language of strings. This paper will show that such algorithms are not, in general, adequate to solve the shortest …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor

Similar Documents

Publication Publication Date Title
Kari On insertion and deletion in formal languages.
Marçais et al. Sketching and sublinear data structures in genomics
Cash et al. A sixth-order exponentially fitted method for the numerical solution of the radial Schrodinger equation
Christof et al. A complete description of the traveling salesman polytope on 8 nodes
Kerber et al. Hemodynamic effects of volume expansion and nitroprusside compared with pericardiocentesis in patients with acute cardiac tamponade
Sadakane et al. Indexing huge genome sequences for solving various problems
Bradford et al. On the inadequacy of tournament algorithms for the N-SCS problem
Dobson et al. Sample sizes for comparing two independent proportions using the continuity‐corrected arc sine transformation
Beeler A new Van der Waerden number.
Fermuller Deciding classes of clause sets by resolution.
Colbourn Cyclic block designs: computational aspects of their construction and analysis.
Ury et al. Use of the Bonferroni inequality for multiple comparisons among means with post hoc contrasts
Gottschalk et al. Tuberculosis of the breast
Rubinov et al. Reconstruction of a string from substring precedence data
Diaz et al. Comparative Study of Finite Element Methods for the Solution of Second Order Linear Two-Point Boundary Value Problems.
Westfall et al. Nonstandard Uses of PROC MULTTEST: Permutational Peto Tests; Permutational and Unconditional t and Binomial Tests
FR2693008B1 (en) Method for recognizing files in a memory, in particular a memory for an integrated circuit card.
Andrews Blood in the water.
Tyroler Honduras: Organ Trafficking
Guerrero et al. 3D PET reconstruction workstation: 1. Design and construction
Myers INFINITE STRUCTURES IN PROGRAMMING LANGUAGES.
Storn Efficient input reordering for the DCT based on a real-valued decimation-in-time FFT
Hille Binary trees and permutations.
Atallah ALGORITHMS FOR VLSI NETWORKS OF PROCESSORS.
Finkelstein et al. Knowledge discovery in a clinical information system to analyze patterns of asthma hospitalization