Efficient Sparse Dynamic Programming for the Merged LCS Problem

The invention relates to a force transducer with at least 100 pC/N sensitivity. The piezo elements of this force transducer are connected rigidly to the force introducing elements, and therefore require no mechanical prestressing. A diaphragm may be provided and is then the only force shunt with a maximum proportion of 5%. The main force flow runs in these transducers through the piezo elements themselves, thereby keeping the pseudo-pyro effect, which is frequently brought about by mechanical shunting, within very narrow limits. Because of bottlenecks in the heat guide path to the piezo elements and the symmetrical construction of the supports, heat transients are also prevented from exerting an appreciable effect on the position of the zero point. This provides zero point stability, which allows accurate measurements in the 0 . . . 1 N range, even where the ambient conditions are unfavorable from the point of view of temperature.

[1]  Hsing-Yen Ann,et al.  Efficient algorithms for finding interleaving relationship between sequences , 2008, Inf. Process. Lett..

[2]  Ömer Egecioglu,et al.  Algorithms For The Constrained Longest Common Subsequence Problems , 2005, Int. J. Found. Comput. Sci..

[3]  B. Birren,et al.  Proof and evolutionary analysis of ancient genome duplication in the yeast Saccharomyces cerevisiae , 2004, Nature.

[4]  Tatsushi Nishi,et al.  DISTRIBUTED OPTIMIZATION METHOD FOR SIMULTANEOUS PRODUCTION SCHEDULING AND TRANSPORTATION ROUTING IN SEMICONDUCTOR FABRICATION BAYS , 2008 .

[5]  Raffaele Giancarlo,et al.  Sparse Dynamic Programming for Longest Common Subsequence from Fragments , 2002, J. Algorithms.

[6]  Gad M. Landau,et al.  Sparse LCS Common Substring Alignment , 2003, Inf. Process. Lett..

[7]  Daniel S. Hirschberg,et al.  Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[8]  Moshe Lewenstein,et al.  Constrained LCS: Hardness and Approximation , 2008, CPM.

[9]  Michael S. Waterman,et al.  Chimeric alignment by dynamic programming: algorithm and biological uses , 1997, RECOMB '97.

[10]  C. Médigue,et al.  MaGe: a microbial genome annotation system supported by synteny results , 2006, Nucleic acids research.

[11]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[12]  A. Poustka,et al.  Timing and mechanism of ancient vertebrate genome duplications -- the adventure of a hypothesis. , 2005, Trends in genetics : TIG.

[13]  Karsten Hokamp,et al.  The 2R hypothesis and the human genome sequence , 2004, Journal of Structural and Functional Genomics.

[14]  Richard C. T. Lee,et al.  Systolic algorithms for the longest common subsequence problem , 1987 .

[15]  Marcos A. Kiwi,et al.  Expected length of the longest common subsequence for large alphabets , 2005 .

[16]  Thomas G. Szymanski,et al.  A fast algorithm for computing longest common subsequences , 1977, CACM.

[17]  Hsing-Yen Ann,et al.  Dynamic programming algorithms for the mosaic longest common subsequence problem , 2007, Inf. Process. Lett..

[18]  Alfred V. Aho,et al.  Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[19]  Charles E. Chapple,et al.  Genome duplication in the teleost fish Tetraodon nigroviridis reveals the early vertebrate proto-karyotype , 2004, Nature.

[20]  Alfredo De Santis,et al.  A simple algorithm for the constrained sequence problems , 2004, Information Processing Letters.

[21]  Gad M. Landau,et al.  On the Common Substring Alignment Problem , 2001, J. Algorithms.

[22]  Chin Lung Lu,et al.  A memory-efficient algorithm for multiple sequence alignment with constraints , 2004, Bioinform..

[23]  Costas S. Iliopoulos,et al.  New efficient algorithms for the LCS and constrained LCS problems , 2008, Inf. Process. Lett..

[24]  開 紅梅.  Intelligent intrusion detection decision response system , 2009 .