1,040 Hits in 4.3 sec

Page 5141 of Mathematical Reviews Vol. , Issue 97H [page]

1997 Mathematical Reviews  
shortest path metrics on well-formed parentheses strings.  ...  Summary: “We present an analysis of two transformations on well-formed parentheses strings.  ... 

A linguistic approach to geometric reasoning

B. Stilman
1993 Computers and Mathematics with Applications  
This approach is based on a broad application of the theory of formal languages and grammars as well as theories of formal problem-solving and planning on the basis of the first-order predicate calculus  ...  This paper reports new results in the investigation of geometrical properties of the first-level subsystems (paths of elements) unified as one-dimensional Linguistic Geometry.  ...  Strings (3.2) form the Language of Trajectory Networks.  ... 
doi:10.1016/0898-1221(93)90049-2 fatcat:cjopdg334neppoxztdimc6bnlq

Mycobacterium tuberculosis interactome analysis unravels potential pathways to drug resistance

Karthik Raman, Nagasuma Chandra
2008 BMC Microbiology  
The shortest paths are then scored and ranked based on a new scheme that considers (a) drug-induced gene upregulation data, from microarray experiments reported in literature, for the individual nodes  ...  We then compute shortest paths from different drug targets to the set of resistance proteins in the protein-protein interactome, to derive a sub-network relevant to study emergence of drug resistance.  ...  The concept of shortest paths has been well accepted in graph theory and is a commonly used metric in the analysis of various networks in fields ranging from transport and communication to speech recognition  ... 
doi:10.1186/1471-2180-8-234 pmid:19105810 pmcid:PMC2649132 fatcat:oclm7eturvhgznmbw7l37g3e3m

Optimal expression evaluation for data parallel architectures

John R. Gilbert, Robert Schreiber
1991 Journal of Parallel and Distributed Computing  
pointed us to the biological literature on the subject.  ...  Acknowledgements We gratefully acknowledge helpful conversations with David Eppstein, who pointed out that the hypercube metric is just 11, and Marshall Bern, whose encyclopediac knowledge of Steiner problems  ...  Here the positions axe a k-dimensional grid, and the metric is the length of a shortest path whose step lengths are all powers of two.  ... 
doi:10.1016/0743-7315(91)90109-m fatcat:4imjtbhtbvborolh3jzc2jbate

Triage of documents containing protein interactions affected by mutations using an NLP based machine learning approach

Jinchan Qu, Albert Steppi, Dongrui Zhong, Jie Hao, Jian Wang, Pei-Yau Lung, Tingting Zhao, Zhe He, Jinfeng Zhang
2020 BMC Genomics  
Results Our system makes use of latest NLP methods with a large number of engineered features including some based on pre-trained word embedding.  ...  Our aim is to identify journal abstracts or paragraphs in full-text articles that contain at least one occurrence of a protein-protein interaction (PPI) affected by a mutation.  ...  All terms within the shortest paths corresponding to positive pairs then had a nonsense string appended, and the terms in the shortest paths corresponding to negative pairs had a different nonsense string  ... 
doi:10.1186/s12864-020-07185-7 pmid:33167858 pmcid:PMC7654050 fatcat:5zx7433izjbnfcq6uehycfnsei

Lattice-based similarity measures between ordered trees

Stephen C Hirtle
1982 Journal of Mathematical Psychology  
within a set of linear strings.  ...  Having set forth some knowledge of Reitman-Rueter trees, section two reviews previous work on similarity between trees, and details why ordered trees are a special case.  ...  The shortest path is constructed by "meeting" the two chunks containing elements u-f, and "joining" the superstructure.  ... 
doi:10.1016/0022-2496(82)90049-9 fatcat:nxzpxqgb7fgnjhhccr2kigif34

String graphs and separators [article]

Jiří Matoušek
2014 arXiv   pre-print
We provide an expository presentation of several results, including very recent ones: some string graphs require an exponential number of crossings in every string representation; exponential number is  ...  always sufficient; string graphs have small separators; and the current best bound on the crossing number of a graph in terms of the pair-crossing number.  ...  It was a pleasure to teach the courses together with Pavel Valtr in Prague and with Michael Hoffmann and Emo Welzl in Zurich, and to work with Jan Kratochvíl on questions in string graphs as well as on  ... 
arXiv:1311.5048v2 fatcat:cq5lx3dtb5hv3hkb4pjaho753e

A Package for the Implementation of Block Codes as Finite Automata [chapter]

Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan
2001 Lecture Notes in Computer Science  
The transformation takes a description of the code in the form of a k × n generator matrix over a field with q elements, representing a finite language containing q k strings, and constructs a minimal  ...  Experiments on the well known Golay code indicate that the new decoding algorithm is considerably more efficient than the traditional Viterbi algorithm run on the original automaton.  ...  Define a winning path as a shortest path from one of the start nodes to a final node.  ... 
doi:10.1007/3-540-44674-5_24 fatcat:trags3dpqrgpxl7jm2rkl3gbme

Motzkin subposets and Motzkin geodesics in Tamari lattices

J.-L. Baril, J.-M. Pallo
2014 Information Processing Letters  
In this paper, we study this rotation on the restricted set of Motzkin words. An upper semimodular join semilattice is obtained and a shortest path metric can be defined.  ...  The Tamari lattice of order n can be defined by the set Dn of Dyck words endowed with the partial order relation induced by the well-known rotation transformation.  ...  Introduction and notations The set D of Dyck words over {(, )} is the language defined by the grammar S λ|(S)|SS where λ is the empty word, i.e. the set of well-formed parentheses strings.  ... 
doi:10.1016/j.ipl.2013.10.001 fatcat:mnrx2c3jnfb6hgkgq44j55k2vy


2003 International Journal of Foundations of Computer Science  
singlesource shortest-paths algorithm.  ...  A common measure of the similarity of two strings is their edit-distance, that is the minimal cost of a series of symbol insertions, deletions, or substitutions transforming one string into the other.  ...  shortest-paths algorithm [32] .  ... 
doi:10.1142/s0129054103002114 fatcat:io4mojcj3rgynpsko3yslsl3ry

Edit-Distance of Weighted Automata [chapter]

Mehryar Mohri
2003 Lecture Notes in Computer Science  
singlesource shortest-paths algorithm.  ...  A common measure of the similarity of two strings is their edit-distance, that is the minimal cost of a series of symbol insertions, deletions, or substitutions transforming one string into the other.  ...  shortest-paths algorithm [32] .  ... 
doi:10.1007/3-540-44977-9_1 fatcat:b5leqgyuonglnf7mwqtnyyzrxi

Scalable kernels for graphs with continuous attributes

Aasa Feragen, Niklas Kasenburg, Jens Petersen, Marleen de Bruijne, Karsten M. Borgwardt
2013 Neural Information Processing Systems  
For instance, the popular shortest path kernel scales as O(n 4 ), where n is the number of nodes.  ...  In our experiments, the presented kernels outperform state-of-the-art kernels in terms of speed and accuracy on classification benchmark datasets.  ...  In the next few lemmas we shall prove that for a fixed a source node v ∈ V , the directed edges along shortest paths from v to other nodes of G form a well-defined directed acyclic graph (DAG), that is  ... 
dblp:conf/nips/FeragenKPBB13 fatcat:azci5pw4tza2bbrdsfkcr6zps4

Linear Regge trajectories from worldsheet lattice parton field theory

Tirthabir Biswas, Marc Grisaru, Warren Siegel
2005 Nuclear Physics B  
We develop general techniques for studying their general asymptotic form.  ...  We show that unlike conventional field theory, the particle field theory of the string's constituents produces in the ladder approximation linear Regge trajectories, in accord with its string theory dual  ...  Calculations in the lattice theory have been limited mostly to the two-dimensional gravity aspects of string theory; only the dynamics of the worldsheet metric has been studied, and relatively little attention  ... 
doi:10.1016/j.nuclphysb.2004.11.004 fatcat:k5ukjwcubneuronttjfbpdzszy

Optimal Any-Angle Pathfinding In Practice

Daniel Damir Harabor, Alban Grastien, Dindar Öz, Vural Aksakalli
2016 The Journal of Artificial Intelligence Research  
The goal is to find a shortest path between a pair of points on a grid map such that the path is not artificially constrained to the points of the grid.  ...  Anya always returns an optimal path if one exists. Moreover it does so without any offline pre-processing or the introduction of additional memory overheads.  ...  The Euclidean Shortest Path Problem is a well known and well researched topic in the areas of Computational Geometry and Computer Graphics.  ... 
doi:10.1613/jair.5007 fatcat:7ps25estencqjknphxzlbkwtdy

Directed Symbolic Execution [chapter]

Kin-Keung Ma, Khoo Yit Phang, Jeffrey S. Foster, Michael Hicks
2011 Lecture Notes in Computer Science  
We propose two new directed symbolic execution strategies that aim to solve this problem: shortest-distance symbolic execution (SDSE) uses a distance metric in an interprocedural control flow graph to  ...  We compare these three with several existing strategies from the literature on a suite of six GNU coreutils programs. We find that SDSE performs extremely well in many cases but may fail badly.  ...  Formally, we can define such paths as those whose sequence of edge labels form a string produced from the PN nonterminal in the grammar shown in Figure 3 (b).  ... 
doi:10.1007/978-3-642-23702-7_11 fatcat:taa7kzyaqjg7rp6j4rivkwmrdy
« Previous Showing results 1 — 15 out of 1,040 results