108,230 Hits in 6.4 sec

Searching for flexible repeated patterns using a non-transitive similarity relation

Henri Soldano, Alain Viari, Marc Champesme
1995 Pattern Recognition Letters  
Given a reflexive and symmetric, but not necessarily transitive, similarity relation defined on an alphabet of symbols, two objects of size k are related if, at each position, their symbols are related  ...  These algorithms derive from the Karp, Miller and Rosenberg algorithms for the identification of repeated patterns. * Corresponding author. 0167-8655/95/$09.50 © 1995 Elsevier Science B.V.  ...  However some situations require a more flexible matching and patterns corresponding to similar, rather than strictly identical, objects are searched for.  ... 
doi:10.1016/0167-8655(94)00095-k fatcat:5jbnxoxjobcifolxtrulbosh6y

Medial temporal lobe memory in childhood: developmental transitions

Elise L. Townsend, Jenny L. Richmond, Vanessa K. Vogel-Farley, Kathleen Thomas
2010 Developmental Science  
Children (6 -10 years old) and adults completed two computerized tasks, place learning (PL) and transitive inference (TI), that each examined relational memory, as well as the flexible use of relational  ...  Findings suggest that the development of relational memory precedes the development of the ability to use relational knowledge flexibly in novel situations.  ...  Nelson for his contributions to project design and implementation, and comments on earlier manuscript drafts.  ... 
doi:10.1111/j.1467-7687.2009.00935.x pmid:20712740 pmcid:PMC2923751 fatcat:nov3hszpfreypd73eyi6ytoeje

Improved hit criteria for DNA local alignment

Laurent Noé, Gregory Kucherov
2004 BMC Bioinformatics  
It specifies a class of patterns assumed to witness a potential similarity, and this choice is decisive for the selectivity and sensitivity of the whole method.  ...  Proposed algorithmic ideas allow to obtain a significant gain in sensitivity of similarity search without increase in execution time.  ...  Acknowledgments We are grateful to Mikhail Roytberg for enlightening discussions, and to Marie-Pierre Etienne, Roman Kolpakov, Gilles Schaeffer and Pierre Valois for their helpful comments at early stages  ... 
doi:10.1186/1471-2105-5-149 pmid:15485572 pmcid:PMC526756 fatcat:vkj773vw4jcmdixihpzwwjezxq

Multi-relational Data Mining for Tetratricopeptide Repeats (TPR)-Like Superfamily Members in Leishmania spp.: Acting-by-Connecting Proteins [chapter]

Karen T. Girão, Fátima C. E. Oliveira, Kaio M. Farias, Italo M. C. Maia, Samara C. Silva, Carla R. F. Gadelha, Laura D. G. Carneiro, Ana C. L. Pacheco, Michel T. Kamimura, Michely C. Diniz, Maria C. Silva, Diana M. Oliveira
2008 Lecture Notes in Computer Science  
The multi-relational data mining (MRDM) approach looks for patterns that involve multiple tables from a relational database made of complex/structured objects whose normalized representation does require  ...  We have applied MRDM methods (relational association rule discovery and probabilistic relational models) with hidden Markov models (HMMs) and Viterbi algorithm (VA) to mine tetratricopeptide repeat (TPR  ...  Variants of BLAST [25] and GlimmerHMM [26] were widely used for sequence similarity searches, comparisons and gene predictions.  ... 
doi:10.1007/978-3-540-88436-1_31 fatcat:72sozzbi3vajtdkpfsyoznilw4

Reversibility, Water-Mediated Switching, and Directed Cell Dynamics [article]

J. C. Phillips
2008 arXiv   pre-print
Protein transitions occur on long time scales ~ us -ms, evocative of the exponentially large viscosities found in glass-forming supercooled liquids just above the glass transition; in searching for mechanisms  ...  The transition states of D34 exhibit a surprisingly simple collective ("geared") pattern when studied by fluorescence near its center, in samples modified mutageneously along its 12 helical repeats.  ...  Searches for ARM and HEAT repeat proteins at present rely mainly on identification of conserved residues at short interhelix turns [51] ; this analysis could be supplemented by looking for hydro patterns  ... 
arXiv:0803.0093v1 fatcat:opqiawcu7rdk5d5x3owmkb7ocm

Brain network dynamics during working memory are modulated by dopamine and diminished in schizophrenia

Urs Braun, Anais Harneit, Giulio Pergola, Tommaso Menara, Axel Schäfer, Richard F. Betzel, Zhenxiang Zang, Janina I. Schweiger, Xiaolong Zhang, Kristina Schwarz, Junfang Chen, Giuseppe Blasi (+7 others)
2021 Nature Communications  
AbstractDynamical brain state transitions are critical for flexible working memory but the network mechanisms are incompletely understood.  ...  The stability of states relates to dopamine D1 receptor gene expression while state transitions are influenced by D2 receptor expression and pharmacological modulation.  ...  We thank Oliver Grimm, Leila Haddad, Michael Schneider, Natalie Hess, Sarah Plier, and Petya Vicheva for valuable research assistance. The authors thank Jason  ... 
doi:10.1038/s41467-021-23694-9 pmid:34108456 fatcat:7hlyjkgo65hbzn2ebwibzm6gzy

Fast time intervals mining using the transitivity of temporal relations

Robert Moskovitch, Yuval Shahar
2013 Knowledge and Information Systems  
The algorithm includes a data structure for TIRP-candidate generation and a novel method for efficient candidate-TIRP generation, by exploiting the transitivity property of Allen's temporal relations.  ...  We introduce an algorithm, called KarmaLego, for the discovery of frequent symbolic time intervals related patterns (TIRPs).  ...  Patel for insightful discussions about time intervals mining.  ... 
doi:10.1007/s10115-013-0707-x fatcat:gmau266rrjdvxb5h7kpj45sixq

Scalable complex pattern search in sequential data

Leila Kaghazian, Dennis McLeod, Reza Sadri
2008 Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '08  
elements of a sequential pattern to minimize repeated passes over the same data.  ...  Performance gains derived from a set of experiments and a sensitivity analysis for the RSPS are also discussed. Our experimental results demonstrate impressive speedup.  ...  For instance, we ran the following patterns which reflex the search for a set of repeated consecutive relaxed double bottom in stock market data for a given company.  ... 
doi:10.1145/1458082.1458336 dblp:conf/cikm/KaghazianMS08 fatcat:zay332dliffyxatfh46mzdifjm

Trace retrieval for business process operational support

Alessio Bottrighi, Luca Canensi, Giorgio Leonardi, Stefania Montani, Paolo Terenziani
2016 Expert systems with applications  
., the number of actions can be given as a range). The tool also relies on a tree structure, adopted as an index for a quick retrieval from the available event log.  ...  Thanks to its characteristics and methodological solutions, the tool implements operational support tasks in a flexible and efficient way, as demonstrated by our experimental results.  ...  In synthesis, in this paper we describe a flexible and efficient case-based retrieval approach, which also allows to query complex pattern to be searched for in the traces.  ... 
doi:10.1016/j.eswa.2015.12.002 fatcat:7cfdy7t6xbe2dflvugl2onvi3a

A flexible motif search technique based on generalized profiles

Philipp Bucher, Kevin Karplus, Nicolas Moeri, Kay Hofmann
1996 Computers and Chemistry  
A flexible motif search technique is presented which has two major components: (1) a generalized profile syntax serving as a motif definition language; and (2) a motif search method specifically adapted  ...  patterns, weight matrices, previously used profiles, and certain types of hidden Markov models (HMMs).  ...  Kay Hofmann was responsible for building the generalized profile search tools and for setting parameters of the profile in converting from alignments.  ... 
doi:10.1016/s0097-8485(96)80003-9 pmid:8867839 fatcat:gw45xedwjna4rop5hmmo6xfpcq

Design Flow Allowing the Effective Use of Non-scan and Scan-Based Tests

Rimantas Seinauskas
2016 Science Journal of Circuits Systems and Signal Processing  
The proposed approach provides more flexibility for test generation.  ...  Design flow and the ability to use non-scan and scan-based ATPG, functional test and fault simulation is presented. The goal is to detect as many faults with non-scan at-speed test.  ...  SAT solvers are widely used for functional and gate-level test generation. Search field increases considerably during the search of the test vector sequence for sequential circuits.  ... 
doi:10.11648/j.cssp.20160502.11 fatcat:h4zvupuvxbfdtj6xmlyqud5qb4

Father-Child and Mother-Child Interactions with Children with Anxiety Disorders: Emotional Expressivity and Flexibility of Dyads

Daniëlle Van der Giessen, Susan Maria Bögels
2017 Journal of Abnormal Child Psychology  
Measures of dyadic emotional expressivity (positive and negative affect) and dyadic emotional flexibility (transitions, dispersion, average duration) were derived from these interactions using state space  ...  Targeting emotional flexibility of dyads with children with an AD, and also emotional expressivity of dyads when mother has an AD, might be a valuable goal for family-based intervention.  ...  Acknowledgement This study was financially supported by a grant from ZonMw, the Netherlands Organisation for Health Research and Development, grant number 945-02-052.  ... 
doi:10.1007/s10802-017-0271-z pmid:28168628 pmcid:PMC5799352 fatcat:d7eedjxolzfm3cbm3oeq2l6sde

Clustering eye movement transitions reveals latent cognitive strategies

Šimon Kucharský, Ingmar Visser, Gabriela-Olivia Truțescu, Paulo Guirro Laurence, Martina Zaharieva, Maartje E. J. Raijmakers
2020 Journal of Eye Movement Research  
These strategies might elicit different eye movement patterns which can thus provide substantial information about the strategy a person uses.  ...  After an overview of existing techniques which use eye movement data for the identification of latent cognitive strategies, we present a relatively easy to apply unsuper-vised method to cluster eye movement  ...  On the other hand, more flexible approaches to modeling the transition patterns would enable us to fix the strategies across items for one cluster, but let vary the strategies across items for another.  ... 
doi:10.16910/jemr.13.1.1 pmid:33828785 pmcid:PMC7886013 fatcat:7c6mlzgbrjdidii7gwgganfzei

Canonical Image Selection by Visual Context Learning

Wengang Zhou, Yijuan Lu, Houqiang Li, Qi Tian
2010 2010 20th International Conference on Pattern Recognition  
Canonical image selection is to select a subset of photos that best summarize a photo collection.  ...  We propose to use visual context learning to discover visual word significance and develop Weighted Set Coverage algorithm to select canonical images containing distinctive visual words.  ...  For data preparation, we use Google Image search to retrieve images with 30 landmark text queries and crawl the first 500 returned images for each query.  ... 
doi:10.1109/icpr.2010.210 dblp:conf/icpr/ZhouLLT10 fatcat:25sn34e43jcsvc6cycwz6zjx3y

On When and How to use SAT to Mine Frequent Itemsets [article]

Rui Henriques and Inês Lynce and Vasco Manquinho
2012 arXiv   pre-print
This has promoted a natural way to combine complex constraints in a highly flexible manner.  ...  This work deepens the study on when and how to use SAT for the frequent itemset mining (FIM) problem by defining different encodings with multiple task-driven enumeration options and search strategies.  ...  and density) whose generation depend on a biasing parameter γ for the emerging of patterns according to a distribution similar as real datasets.  ... 
arXiv:1207.6253v1 fatcat:s5a3igmhtzb67cmiber6wqmge4
« Previous Showing results 1 — 15 out of 108,230 results