作者: CANE 時(shí)間: 2025-3-21 20:38
The Direct Problem of Kinematics SM8 SEMSof one and only one of . and .. This article aims at defining an automaton recognizing sep-min(.)..In the case where ., the complexity in time of the algorithm for constructing the automaton is O(|.|Card.). In the general case, the complexity is proportional to the product of the size of the automaton by the size of the alphabet.作者: Ledger 時(shí)間: 2025-3-22 03:16
Manfred Ackermann,Stefan Grützmachermatching is also considered. We present algorithms solving these problems in sequential time ..| × |..| × max{deg(..), deg (T.)} × log.(..), deg (T.)})). Our previous result shows that computing the editing distance between unordered labeled trees is NP-complete.作者: SPURN 時(shí)間: 2025-3-22 07:27
I. L. Ermolov,S. S. Graskin,S. P. Khripunovithm, O(n/m) vertices are selected from . such that any path of length more than . ?2 must contain at least one of the selected vertices. A search is performed using the selected vertices as ‘bases’. A suffix tree is used effectively in the algorithm. Although the size of the alphabet is assumed to 作者: optional 時(shí)間: 2025-3-22 12:41
I. L. Ermolov,S. S. Graskin,S. P. Khripunovg of length .. This is a natural generalization of the string matching problem where only occurrences of the whole pattern are sought. The Knuth-Morris-Pratt string matching algorithm can be easily adapted to solve the string prefix-matching problem without making additional comparisons..In this pap作者: 心胸狹窄 時(shí)間: 2025-3-22 13:10
Problems with Secure Control of SEMS Groupg design and for biomolecular recognition and interaction of proteins in general. Our algorithms have been implemented and experimented on several ‘real world’ biological examples. The preliminary experimental results show an order of magnitude improvement in the actual run-time of the algorithms in作者: 心胸狹窄 時(shí)間: 2025-3-22 20:35 作者: geometrician 時(shí)間: 2025-3-23 01:16 作者: Triglyceride 時(shí)間: 2025-3-23 04:24
Smart Electromechanical Systemsorst-case performance guarantee. Both algorithms behave badly in the worst case, whether the underlying alphabet is unbounded or of fixed size. For a Tournament style algorithm proposed by Timkovskii, we show that the length of the SCS found is between ./4 and (3. + 2)/8 times the length of the opti作者: 逃避責(zé)任 時(shí)間: 2025-3-23 09:32 作者: 男生如果明白 時(shí)間: 2025-3-23 09:43
https://doi.org/10.1007/978-3-319-53327-8 consider the problem of computing the shortest series of reversals that transform one permutation to another. The permutations describe the order of genes on corresponding chromosomes, and a . takes an arbitrary substring of elements and reverses their order..For this problem we develop two algorit作者: corpuscle 時(shí)間: 2025-3-23 17:54 作者: Toxoid-Vaccines 時(shí)間: 2025-3-23 20:08
Boris A. Kulik,Alexander Ya. Fridman., for which ..,..., r. and .., ... r. are similar. In this paper we consider two criterions of similarity: the Hamming distance (. mismatches) and the edit distance (. differences). For a string . of length . and an integer . our algorithm reports all locally optimal approximate repeats, ., for whi作者: depreciate 時(shí)間: 2025-3-24 00:44 作者: 太空 時(shí)間: 2025-3-24 04:09 作者: 永久 時(shí)間: 2025-3-24 10:29
Studies in Systems, Decision and Controla mismatch (the pattern does not occur beginning at that location in the text) or a potential match (the pattern may occur beginning at that location in the text). Some of the potential matches could be ., i.e., the pattern may not occur beginning at some location in the text declared to be a potent作者: 權(quán)宜之計(jì) 時(shí)間: 2025-3-24 13:00 作者: Tremor 時(shí)間: 2025-3-24 15:36
Patrick Margardt,Tieto Deutschland GmbHr by at most . mismatches. This problem is motivated by the dot-matrix constructions for sequence comparison and optimal oligonucleotide probe selection routinely used in molecular biology. In the case . the problem coincides with the classical . problem. We present a new approach to this problem ba作者: Assemble 時(shí)間: 2025-3-24 21:14 作者: capsule 時(shí)間: 2025-3-24 23:27
Christian Friege,Ralph Kampwirth the edit distance between . and . is ≤ . is considered. We concentrate on the special case in which . is available for preprocessing before the searches with varying . and .. It is shown how the searches can be done fast using the suffix tree of . augmented with the suffix links as the preprocessed作者: analogous 時(shí)間: 2025-3-25 07:20 作者: Perceive 時(shí)間: 2025-3-25 10:06 作者: chisel 時(shí)間: 2025-3-25 15:08
https://doi.org/10.1007/BFb0029791Algorithmik; Combinatorics; Computational Biology; Kombinatorik; Mustererkennung; Pattern Matching; Perfor作者: 抵消 時(shí)間: 2025-3-25 18:12
978-3-540-56764-6Springer-Verlag Berlin Heidelberg 1993作者: radiograph 時(shí)間: 2025-3-25 21:36 作者: 草率女 時(shí)間: 2025-3-26 02:47 作者: 放縱 時(shí)間: 2025-3-26 06:40
A new editing based distance between unordered labeled trees,matching is also considered. We present algorithms solving these problems in sequential time ..| × |..| × max{deg(..), deg (T.)} × log.(..), deg (T.)})). Our previous result shows that computing the editing distance between unordered labeled trees is NP-complete.作者: 致詞 時(shí)間: 2025-3-26 10:57
Conference proceedings 1993.Combinatorial pattern matching addresses issues of searchingandmatching of strings and more complicated patterns suchas trees, regularexpressions, extended expressions, etc.The goal is to derive nontrivialcombinatorial propertiesfor such structures and then to exploit theseproperties inorder to ach作者: A簡潔的 時(shí)間: 2025-3-26 14:13
Tight comparison bounds for the string prefix-matching problem,er we study the exact complexity of the string prefix-matching problem in the deterministic sequential comparison model. Our bounds do not account for comparisons made in a pattern preprocessing step. The following results are presented:作者: Bereavement 時(shí)間: 2025-3-26 20:35
On the worst-case behaviour of some approximation algorithms for the shortest common supersequence mal in the worst case. The corresponding bounds proved for the obvious Greedy algorithm are (4. + 17)/27 and (.?1)/e. Even for a binary alphabet, no constant performance guarantee is possible for either algorithm, in contrast with the guarantee of 2 provided by a trivial algorithm in that case.作者: Phonophobia 時(shí)間: 2025-3-26 21:43
An algorithm for locating non-overlapping regions of maximum alignment score,is problem can be put together as the union of very few of these pieces. Other ideas include the use of candidate-lists, an application of the ideas of Apostolico et al. [1] to our problem domain, and divide and conquer techniques.作者: 騙子 時(shí)間: 2025-3-27 04:02
A unifying look at d-dimensional periodicities and space coverings,hmic issues in pattern matching. First, the covering classification allows an efficient use of the now classical “duel” paradigm. Second, .-dimensional pattern matching complexity is intrinsically different for each class.作者: 桉樹 時(shí)間: 2025-3-27 07:33
Conference proceedings 1993mand for speedand efficiency that comesespecially from molecular biology and the Genomeproject,but also from other diverse areas such asinformationretrieval, pattern recognition, compilers, data compression,and program analysis.作者: FELON 時(shí)間: 2025-3-27 10:55
Problems with Secure Control of SEMS Groupon applications. The algorithmic similarity between the problems emphasizes the importance of interdisciplinary research in Computational Molecular Biology. Future research directions are outlined as well.作者: 裙帶關(guān)系 時(shí)間: 2025-3-27 14:32
Boris A. Kulik,Alexander Ya. Fridmanputer vision or image processing, our problem definitions identify an important gap in the fundamental theory of image formation and image processing — how to determine, even in the absence of noise, if a digitized image of a scene could contain an image of a given pattern?作者: 浮雕 時(shí)間: 2025-3-27 17:55 作者: Osteoarthritis 時(shí)間: 2025-3-27 23:33 作者: 和平主義者 時(shí)間: 2025-3-28 04:05 作者: AWL 時(shí)間: 2025-3-28 09:46
3-D docking of protein molecules,on applications. The algorithmic similarity between the problems emphasizes the importance of interdisciplinary research in Computational Molecular Biology. Future research directions are outlined as well.作者: Enteropathic 時(shí)間: 2025-3-28 13:10
Two dimensional pattern matching in a digitized image,puter vision or image processing, our problem definitions identify an important gap in the fundamental theory of image formation and image processing — how to determine, even in the absence of noise, if a digitized image of a scene could contain an image of a given pattern?作者: 提煉 時(shí)間: 2025-3-28 17:16
A fast filtration algorithm for the substring matching problem,escribes a two-stage process. The first stage (multiple filtration) uses a new technique to preselect roughly similar .-tuples. The second stage compares these .-tuples using an accurate method. We demonstrate the advantages of multiple filtration in comparison with other techniques for approximate pattern matching.作者: incredulity 時(shí)間: 2025-3-28 22:50
Approximate string-matching over suffix trees, the output), and ... + size of the output). Here . = |T|, . = |P|, and . varies depending on the problem instance between 0 and .. In the case of the unit cost edit distance it is shown that ..|∑|.)) where . is the alphabet.作者: 忘川河 時(shí)間: 2025-3-29 02:59
Multiple sequence comparison and ,-dimensional image reconstruction,that this number may be large. An improved version of the original algorithm is introduced that avoids costly dot-matrix multiplications and runs in ..·L.) time (. is the length of the longest sequence). This is equivalent to only one iteration of the original algorithm. We also discuss applications to DNA/protein sequence comparisons.作者: 歌曲 時(shí)間: 2025-3-29 05:09
I. L. Ermolov,S. S. Graskin,S. P. Khripunover we study the exact complexity of the string prefix-matching problem in the deterministic sequential comparison model. Our bounds do not account for comparisons made in a pattern preprocessing step. The following results are presented:作者: 神刊 時(shí)間: 2025-3-29 09:26 作者: 颶風(fēng) 時(shí)間: 2025-3-29 14:02
The Inverse Problem of Kinematics SM8 SEMSis problem can be put together as the union of very few of these pieces. Other ideas include the use of candidate-lists, an application of the ideas of Apostolico et al. [1] to our problem domain, and divide and conquer techniques.作者: 高爾夫 時(shí)間: 2025-3-29 17:33
Smart Home – Utopie oder Realit?t?hmic issues in pattern matching. First, the covering classification allows an efficient use of the now classical “duel” paradigm. Second, .-dimensional pattern matching complexity is intrinsically different for each class.作者: crockery 時(shí)間: 2025-3-29 19:42
0302-9743 June 1993.Combinatorial pattern matching addresses issues of searchingandmatching of strings and more complicated patterns suchas trees, regularexpressions, extended expressions, etc.The goal is to derive nontrivialcombinatorial propertiesfor such structures and then to exploit theseproperties inor作者: 遺傳 時(shí)間: 2025-3-30 00:03 作者: Terminal 時(shí)間: 2025-3-30 07:33
Smart Electromechanical Systemsists a string constructed by concatenations and superpositions of . of which . is a substring. A substring . of . is called a . of . if . covers .. We present an . time algorithm for finding all the seeds of a given string of length ..作者: GEON 時(shí)間: 2025-3-30 11:41
Boris A. Kulik,Alexander Ya. Fridmane edit distance (. differences). For a string . of length . and an integer . our algorithm reports all locally optimal approximate repeats, ., for which the Hamming distance of . and . is at most . in O(. log (n/k)) time, or all those for which the edit distance of . and . is at most ., in O(. log . log .) time.作者: 展覽 時(shí)間: 2025-3-30 15:17
A linear time pattern matching algorithm between a string and a tree,performed using the selected vertices as ‘bases’. A suffix tree is used effectively in the algorithm. Although the size of the alphabet is assumed to be bounded by a constant in this paper, the algorithm can be applied to the case of unbounded alphabets by increasing the time complexity to .(. log .).作者: sleep-spindles 時(shí)間: 2025-3-30 17:25
Covering a string,ists a string constructed by concatenations and superpositions of . of which . is a substring. A substring . of . is called a . of . if . covers .. We present an . time algorithm for finding all the seeds of a given string of length ..作者: 遷移 時(shí)間: 2025-3-30 21:30 作者: 迅速飛過 時(shí)間: 2025-3-31 03:44 作者: PANT 時(shí)間: 2025-3-31 05:33
Tight comparison bounds for the string prefix-matching problem,g of length .. This is a natural generalization of the string matching problem where only occurrences of the whole pattern are sought. The Knuth-Morris-Pratt string matching algorithm can be easily adapted to solve the string prefix-matching problem without making additional comparisons..In this pap作者: Corporeal 時(shí)間: 2025-3-31 09:38
3-D docking of protein molecules,g design and for biomolecular recognition and interaction of proteins in general. Our algorithms have been implemented and experimented on several ‘real world’ biological examples. The preliminary experimental results show an order of magnitude improvement in the actual run-time of the algorithms in作者: Androgen 時(shí)間: 2025-3-31 15:02 作者: ARBOR 時(shí)間: 2025-3-31 17:32 作者: 圓錐體 時(shí)間: 2025-3-31 21:43
On the worst-case behaviour of some approximation algorithms for the shortest common supersequence orst-case performance guarantee. Both algorithms behave badly in the worst case, whether the underlying alphabet is unbounded or of fixed size. For a Tournament style algorithm proposed by Timkovskii, we show that the length of the SCS found is between ./4 and (3. + 2)/8 times the length of the opti作者: Robust 時(shí)間: 2025-4-1 03:00
An algorithm for locating non-overlapping regions of maximum alignment score,coring alignment between them. This significantly improves the previously best known bound of ..) for the worst-case complexity of this problem. One of the central ideas in the design of this algorithm is that of partitioning a matrix into pieces in such a way that all submatrices of interest for th作者: 想象 時(shí)間: 2025-4-1 09:18
Exact and approximation algorithms for the inversion distance between two chromosomes, consider the problem of computing the shortest series of reversals that transform one permutation to another. The permutations describe the order of genes on corresponding chromosomes, and a . takes an arbitrary substring of elements and reverses their order..For this problem we develop two algorit作者: 冷淡周邊 時(shí)間: 2025-4-1 11:34 作者: arthroscopy 時(shí)間: 2025-4-1 15:05
