muBLASTP: database-indexed protein sequence search on multicore CPUs.

PubMed

Zhang, Jing; Misra, Sanchit; Wang, Hao; Feng, Wu-Chun

2016-11-04

The Basic Local Alignment Search Tool (BLAST) is a fundamental program in the life sciences that searches databases for sequences that are most similar to a query sequence. Currently, the BLAST algorithm utilizes a query-indexed approach. Although many approaches suggest that sequence search with a database index can achieve much higher throughput (e.g., BLAT, SSAHA, and CAFE), they cannot deliver the same level of sensitivity as the query-indexed BLAST, i.e., NCBI BLAST, or they can only support nucleotide sequence search, e.g., MegaBLAST. Due to different challenges and characteristics between query indexing and database indexing, the existing techniques for query-indexed search cannot be used into database indexed search. muBLASTP, a novel database-indexed BLAST for protein sequence search, delivers identical hits returned to NCBI BLAST. On Intel Haswell multicore CPUs, for a single query, the single-threaded muBLASTP achieves up to a 4.41-fold speedup for alignment stages, and up to a 1.75-fold end-to-end speedup over single-threaded NCBI BLAST. For a batch of queries, the multithreaded muBLASTP achieves up to a 5.7-fold speedups for alignment stages, and up to a 4.56-fold end-to-end speedup over multithreaded NCBI BLAST. With a newly designed index structure for protein database and associated optimizations in BLASTP algorithm, we re-factored BLASTP algorithm for modern multicore processors that achieves much higher throughput with acceptable memory footprint for the database index.

cuBLASTP: Fine-Grained Parallelization of Protein Sequence Search on CPU+GPU.

PubMed

Zhang, Jing; Wang, Hao; Feng, Wu-Chun

2017-01-01

BLAST, short for Basic Local Alignment Search Tool, is a ubiquitous tool used in the life sciences for pairwise sequence search. However, with the advent of next-generation sequencing (NGS), whether at the outset or downstream from NGS, the exponential growth of sequence databases is outstripping our ability to analyze the data. While recent studies have utilized the graphics processing unit (GPU) to speedup the BLAST algorithm for searching protein sequences (i.e., BLASTP), these studies use coarse-grained parallelism, where one sequence alignment is mapped to only one thread. Such an approach does not efficiently utilize the capabilities of a GPU, particularly due to the irregularity of BLASTP in both execution paths and memory-access patterns. To address the above shortcomings, we present a fine-grained approach to parallelize BLASTP, where each individual phase of sequence search is mapped to many threads on a GPU. This approach, which we refer to as cuBLASTP, reorders data-access patterns and reduces divergent branches of the most time-consuming phases (i.e., hit detection and ungapped extension). In addition, cuBLASTP optimizes the remaining phases (i.e., gapped extension and alignment with trace back) on a multicore CPU and overlaps their execution with the phases running on the GPU.

PIPI: PTM-Invariant Peptide Identification Using Coding Method.

PubMed

Yu, Fengchao; Li, Ning; Yu, Weichuan

2016-12-02

In computational proteomics, the identification of peptides with an unlimited number of post-translational modification (PTM) types is a challenging task. The computational cost associated with database search increases exponentially with respect to the number of modified amino acids and linearly with respect to the number of potential PTM types at each amino acid. The problem becomes intractable very quickly if we want to enumerate all possible PTM patterns. To address this issue, one group of methods named restricted tools (including Mascot, Comet, and MS-GF+) only allow a small number of PTM types in database search process. Alternatively, the other group of methods named unrestricted tools (including MS-Alignment, ProteinProspector, and MODa) avoids enumerating PTM patterns with an alignment-based approach to localizing and characterizing modified amino acids. However, because of the large search space and PTM localization issue, the sensitivity of these unrestricted tools is low. This paper proposes a novel method named PIPI to achieve PTM-invariant peptide identification. PIPI belongs to the category of unrestricted tools. It first codes peptide sequences into Boolean vectors and codes experimental spectra into real-valued vectors. For each coded spectrum, it then searches the coded sequence database to find the top scored peptide sequences as candidates. After that, PIPI uses dynamic programming to localize and characterize modified amino acids in each candidate. We used simulation experiments and real data experiments to evaluate the performance in comparison with restricted tools (i.e., Mascot, Comet, and MS-GF+) and unrestricted tools (i.e., Mascot with error tolerant search, MS-Alignment, ProteinProspector, and MODa). Comparison with restricted tools shows that PIPI has a close sensitivity and running speed. Comparison with unrestricted tools shows that PIPI has the highest sensitivity except for Mascot with error tolerant search and ProteinProspector. These two tools simplify the task by only considering up to one modified amino acid in each peptide, which results in a higher sensitivity but has difficulty in dealing with multiple modified amino acids. The simulation experiments also show that PIPI has the lowest false discovery proportion, the highest PTM characterization accuracy, and the shortest running time among the unrestricted tools.

A Systolic Array-Based FPGA Parallel Architecture for the BLAST Algorithm

PubMed Central

Guo, Xinyu; Wang, Hong; Devabhaktuni, Vijay

2012-01-01

A design of systolic array-based Field Programmable Gate Array (FPGA) parallel architecture for Basic Local Alignment Search Tool (BLAST) Algorithm is proposed. BLAST is a heuristic biological sequence alignment algorithm which has been used by bioinformatics experts. In contrast to other designs that detect at most one hit in one-clock-cycle, our design applies a Multiple Hits Detection Module which is a pipelining systolic array to search multiple hits in a single-clock-cycle. Further, we designed a Hits Combination Block which combines overlapping hits from systolic array into one hit. These implementations completed the first and second step of BLAST architecture and achieved significant speedup comparing with previously published architectures. PMID:25969747

The identification of complete domains within protein sequences using accurate E-values for semi-global alignment

PubMed Central

Kann, Maricel G.; Sheetlin, Sergey L.; Park, Yonil; Bryant, Stephen H.; Spouge, John L.

2007-01-01

The sequencing of complete genomes has created a pressing need for automated annotation of gene function. Because domains are the basic units of protein function and evolution, a gene can be annotated from a domain database by aligning domains to the corresponding protein sequence. Ideally, complete domains are aligned to protein subsequences, in a ‘semi-global alignment’. Local alignment, which aligns pieces of domains to subsequences, is common in high-throughput annotation applications, however. It is a mature technique, with the heuristics and accurate E-values required for screening large databases and evaluating the screening results. Hidden Markov models (HMMs) provide an alternative theoretical framework for semi-global alignment, but their use is limited because they lack heuristic acceleration and accurate E-values. Our new tool, GLOBAL, overcomes some limitations of previous semi-global HMMs: it has accurate E-values and the possibility of the heuristic acceleration required for high-throughput applications. Moreover, according to a standard of truth based on protein structure, two semi-global HMM alignment tools (GLOBAL and HMMer) had comparable performance in identifying complete domains, but distinctly outperformed two tools based on local alignment. When searching for complete protein domains, therefore, GLOBAL avoids disadvantages commonly associated with HMMs, yet maintains their superior retrieval performance. PMID:17596268

Finding similar nucleotide sequences using network BLAST searches.

PubMed

Ladunga, Istvan

2009-06-01

The Basic Local Alignment Search Tool (BLAST) is a keystone of bioinformatics due to its performance and user-friendliness. Beginner and intermediate users will learn how to design and submit blastn and Megablast searches on the Web pages at the National Center for Biotechnology Information. We map nucleic acid sequences to genomes, find identical or similar mRNA, expressed sequence tag, and noncoding RNA sequences, and run Megablast searches, which are much faster than blastn. Understanding results is assisted by taxonomy reports, genomic views, and multiple alignments. We interpret expected frequency thresholds, biological significance, and statistical significance. Weak hits provide no evidence, but hints for further analyses. We find genes that may code for homologous proteins by translated BLAST. We reduce false positives by filtering out low-complexity regions. Parsed BLAST results can be integrated into analysis pipelines. Links in the output connect to Entrez, PUBMED, structural, sequence, interaction, and expression databases. This facilitates integration with a wide spectrum of biological knowledge.

mTM-align: a server for fast protein structure database search and multiple protein structure alignment.

PubMed

Dong, Runze; Pan, Shuo; Peng, Zhenling; Zhang, Yang; Yang, Jianyi

2018-05-21

With the rapid increase of the number of protein structures in the Protein Data Bank, it becomes urgent to develop algorithms for efficient protein structure comparisons. In this article, we present the mTM-align server, which consists of two closely related modules: one for structure database search and the other for multiple structure alignment. The database search is speeded up based on a heuristic algorithm and a hierarchical organization of the structures in the database. The multiple structure alignment is performed using the recently developed algorithm mTM-align. Benchmark tests demonstrate that our algorithms outperform other peering methods for both modules, in terms of speed and accuracy. One of the unique features for the server is the interplay between database search and multiple structure alignment. The server provides service not only for performing fast database search, but also for making accurate multiple structure alignment with the structures found by the search. For the database search, it takes about 2-5 min for a structure of a medium size (∼300 residues). For the multiple structure alignment, it takes a few seconds for ∼10 structures of medium sizes. The server is freely available at: http://yanglab.nankai.edu.cn/mTM-align/.

FLASHFLOOD: A 3D Field-based similarity search and alignment method for flexible molecules

NASA Astrophysics Data System (ADS)

Pitman, Michael C.; Huber, Wolfgang K.; Horn, Hans; Krämer, Andreas; Rice, Julia E.; Swope, William C.

2001-07-01

A three-dimensional field-based similarity search and alignment method for flexible molecules is introduced. The conformational space of a flexible molecule is represented in terms of fragments and torsional angles of allowed conformations. A user-definable property field is used to compute features of fragment pairs. Features are generalizations of CoMMA descriptors (Silverman, B.D. and Platt, D.E., J. Med. Chem., 39 (1996) 2129.) that characterize local regions of the property field by its local moments. The features are invariant under coordinate system transformations. Features taken from a query molecule are used to form alignments with fragment pairs in the database. An assembly algorithm is then used to merge the fragment pairs into full structures, aligned to the query. Key to the method is the use of a context adaptive descriptor scaling procedure as the basis for similarity. This allows the user to tune the weights of the various feature components based on examples relevant to the particular context under investigation. The property fields may range from simple, phenomenological fields, to fields derived from quantum mechanical calculations. We apply the method to the dihydrofolate/methotrexate benchmark system, and show that when one injects relevant contextual information into the descriptor scaling procedure, better results are obtained more efficiently. We also show how the method works and include computer times for a query from a database that represents approximately 23 million conformers of seventeen flexible molecules.

Model of myosin node aggregation into a contractile ring: the effect of local alignment

NASA Astrophysics Data System (ADS)

Ojkic, Nikola; Wu, Jian-Qiu; Vavylonis, Dimitrios

2011-09-01

Actomyosin bundles frequently form through aggregation of membrane-bound myosin clusters. One such example is the formation of the contractile ring in fission yeast from a broad band of cortical nodes. Nodes are macromolecular complexes containing several dozens of myosin-II molecules and a few formin dimers. The condensation of a broad band of nodes into the contractile ring has been previously described by a search, capture, pull and release (SCPR) model. In SCPR, a random search process mediated by actin filaments nucleated by formins leads to transient actomyosin connections among nodes that pull one another into a ring. The SCPR model reproduces the transport of nodes over long distances and predicts observed clump-formation instabilities in mutants. However, the model does not generate transient linear elements and meshwork structures as observed in some wild-type and mutant cells during ring assembly. As a minimal model of node alignment, we added short-range aligning forces to the SCPR model representing currently unresolved mechanisms that may involve structural components, cross-linking and bundling proteins. We studied the effect of the local node alignment mechanism on ring formation numerically. We varied the new parameters and found viable rings for a realistic range of values. Morphologically, transient structures that form during ring assembly resemble those observed in experiments with wild-type and cdc25-22 cells. Our work supports a hierarchical process of ring self-organization involving components drawn together from distant parts of the cell followed by progressive stabilization.

Memory-efficient dynamic programming backtrace and pairwise local sequence alignment.

PubMed

Newberg, Lee A

2008-08-15

A backtrace through a dynamic programming algorithm's intermediate results in search of an optimal path, or to sample paths according to an implied probability distribution, or as the second stage of a forward-backward algorithm, is a task of fundamental importance in computational biology. When there is insufficient space to store all intermediate results in high-speed memory (e.g. cache) existing approaches store selected stages of the computation, and recompute missing values from these checkpoints on an as-needed basis. Here we present an optimal checkpointing strategy, and demonstrate its utility with pairwise local sequence alignment of sequences of length 10,000. Sample C++-code for optimal backtrace is available in the Supplementary Materials. Supplementary data is available at Bioinformatics online.

A flexible motif search technique based on generalized profiles.

PubMed

Bucher, P; Karplus, K; Moeri, N; Hofmann, K

1996-03-01

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 to the problem of finding multiple instances of a motif in the same sequence. The new profile structure, which is the core of the generalized profile syntax, combines the functions of a variety of motif descriptors implemented in other methods, including regular expression-like patterns, weight matrices, previously used profiles, and certain types of hidden Markov models (HMMs). The relationship between generalized profiles and other biomolecular motif descriptors is analyzed in detail, with special attention to HMMs. Generalized profiles are shown to be equivalent to a particular class of HMMs, and conversion procedures in both directions are given. The conversion procedures provide an interpretation for local alignment in the framework of stochastic models, allowing for clear, simple significance tests. A mathematical statement of the motif search problem defines the new method exactly without linking it to a specific algorithmic solution. Part of the definition includes a new definition of disjointness of alignments.

How the Whole School, Whole Community, Whole Child Model Works: Creating Greater Alignment, Integration, and Collaboration Between Health and Education

PubMed Central

Chiang, Rachelle Johnsson; Meagher, Whitney; Slade, Sean

2015-01-01

BACKGROUND The Whole School, Whole Community, Whole Child (WSCC) model calls for greater collaboration across the community, school, and health sectors to meet the needs and support the full potential of each child. This article reports on how 3 states and 2 local school districts have implemented aspects of the WSCC model through collaboration, leadership and policy creation, alignment, and implementation. METHODS We searched state health and education department websites, local school district websites, state legislative databases, and sources of peer-reviewed and gray literature to identify materials demonstrating adoption and implementation of coordinated school health, the WSCC model, and associated policies and practices in identified states and districts. We conducted informal interviews in each state and district to reinforce the document review. RESULTS States and local school districts have been able to strategically increase collaboration, integration, and alignment of health and education through the adoption and implementation of policy and practice supporting the WSCC model. Successful utilization of the WSCC model has led to substantial positive changes in school health environments, policies, and practices. CONCLUSIONS Collaboration among health and education sectors to integrate and align services may lead to improved efficiencies and better health and education outcomes for students. PMID:26440819

Genetic Testing Registry

MedlinePlus

... Splign Vector Alignment Search Tool (VAST) All Data & Software Resources... Domains & Structures BioSystems Cn3D Conserved Domain Database (CDD) Conserved Domain Search Service (CD Search) Structure (Molecular Modeling Database) Vector Alignment ...

National Center for Biotechnology Information

MedlinePlus

... Splign Vector Alignment Search Tool (VAST) All Data & Software Resources... Domains & Structures BioSystems Cn3D Conserved Domain Database (CDD) Conserved Domain Search Service (CD Search) Structure (Molecular Modeling Database) Vector Alignment ...

Robust hashing with local models for approximate similarity search.

PubMed

Song, Jingkuan; Yang, Yi; Li, Xuelong; Huang, Zi; Yang, Yang

2014-07-01

Similarity search plays an important role in many applications involving high-dimensional data. Due to the known dimensionality curse, the performance of most existing indexing structures degrades quickly as the feature dimensionality increases. Hashing methods, such as locality sensitive hashing (LSH) and its variants, have been widely used to achieve fast approximate similarity search by trading search quality for efficiency. However, most existing hashing methods make use of randomized algorithms to generate hash codes without considering the specific structural information in the data. In this paper, we propose a novel hashing method, namely, robust hashing with local models (RHLM), which learns a set of robust hash functions to map the high-dimensional data points into binary hash codes by effectively utilizing local structural information. In RHLM, for each individual data point in the training dataset, a local hashing model is learned and used to predict the hash codes of its neighboring data points. The local models from all the data points are globally aligned so that an optimal hash code can be assigned to each data point. After obtaining the hash codes of all the training data points, we design a robust method by employing l2,1 -norm minimization on the loss function to learn effective hash functions, which are then used to map each database point into its hash code. Given a query data point, the search process first maps it into the query hash code by the hash functions and then explores the buckets, which have similar hash codes to the query hash code. Extensive experimental results conducted on real-life datasets show that the proposed RHLM outperforms the state-of-the-art methods in terms of search quality and efficiency.

Embedding strategies for effective use of information from multiple sequence alignments.

PubMed Central

Henikoff, S.; Henikoff, J. G.

1997-01-01

We describe a new strategy for utilizing multiple sequence alignment information to detect distant relationships in searches of sequence databases. A single sequence representing a protein family is enriched by replacing conserved regions with position-specific scoring matrices (PSSMs) or consensus residues derived from multiple alignments of family members. In comprehensive tests of these and other family representations, PSSM-embedded queries produced the best results overall when used with a special version of the Smith-Waterman searching algorithm. Moreover, embedding consensus residues instead of PSSMs improved performance with readily available single sequence query searching programs, such as BLAST and FASTA. Embedding PSSMs or consensus residues into a representative sequence improves searching performance by extracting multiple alignment information from motif regions while retaining single sequence information where alignment is uncertain. PMID:9070452

Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation

PubMed Central

2011-01-01

Background The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. Results A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from http://dna.uio.no/swipe/ under the GNU Affero General Public License. Conclusions Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance. PMID:21631914

Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation.

PubMed

Rognes, Torbjørn

2011-06-01

The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from http://dna.uio.no/swipe/ under the GNU Affero General Public License. Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance.

Implied alignment: a synapomorphy-based multiple-sequence alignment method and its use in cladogram search

NASA Technical Reports Server (NTRS)

Wheeler, Ward C.

2003-01-01

A method to align sequence data based on parsimonious synapomorphy schemes generated by direct optimization (DO; earlier termed optimization alignment) is proposed. DO directly diagnoses sequence data on cladograms without an intervening multiple-alignment step, thereby creating topology-specific, dynamic homology statements. Hence, no multiple-alignment is required to generate cladograms. Unlike general and globally optimal multiple-alignment procedures, the method described here, implied alignment (IA), takes these dynamic homologies and traces them back through a single cladogram, linking the unaligned sequence positions in the terminal taxa via DO transformation series. These "lines of correspondence" link ancestor-descendent states and, when displayed as linearly arrayed columns without hypothetical ancestors, are largely indistinguishable from standard multiple alignment. Since this method is based on synapomorphy, the treatment of certain classes of insertion-deletion (indel) events may be different from that of other alignment procedures. As with all alignment methods, results are dependent on parameter assumptions such as indel cost and transversion:transition ratios. Such an IA could be used as a basis for phylogenetic search, but this would be questionable since the homologies derived from the implied alignment depend on its natal cladogram and any variance, between DO and IA + Search, due to heuristic approach. The utility of this procedure in heuristic cladogram searches using DO and the improvement of heuristic cladogram cost calculations are discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

Automated Ontology Alignment with Fuselets for Community of Interest (COI) Integration

DTIC Science & Technology

2008-09-01

Search Example ............................................................................... 22 Figure 8 - Federated Search Example Revisited...integrating information from various sources through a single query. This is the traditional federated search problem, where the sources don’t...Figure 7 - Federated Search Example For the data sources in the graphic above, the ontologies align in a fairly straightforward manner

MetalS(3), a database-mining tool for the identification of structurally similar metal sites.

PubMed

Valasatava, Yana; Rosato, Antonio; Cavallaro, Gabriele; Andreini, Claudia

2014-08-01

We have developed a database search tool to identify metal sites having structural similarity to a query metal site structure within the MetalPDB database of minimal functional sites (MFSs) contained in metal-binding biological macromolecules. MFSs describe the local environment around the metal(s) independently of the larger context of the macromolecular structure. Such a local environment has a determinant role in tuning the chemical reactivity of the metal, ultimately contributing to the functional properties of the whole system. The database search tool, which we called MetalS(3) (Metal Sites Similarity Search), can be accessed through a Web interface at http://metalweb.cerm.unifi.it/tools/metals3/ . MetalS(3) uses a suitably adapted version of an algorithm that we previously developed to systematically compare the structure of the query metal site with each MFS in MetalPDB. For each MFS, the best superposition is kept. All these superpositions are then ranked according to the MetalS(3) scoring function and are presented to the user in tabular form. The user can interact with the output Web page to visualize the structural alignment or the sequence alignment derived from it. Options to filter the results are available. Test calculations show that the MetalS(3) output correlates well with expectations from protein homology considerations. Furthermore, we describe some usage scenarios that highlight the usefulness of MetalS(3) to obtain mechanistic and functional hints regardless of homology.

Dynamic programming algorithms for biological sequence comparison.

PubMed

Pearson, W R; Miller, W

1992-01-01

Efficient dynamic programming algorithms are available for a broad class of protein and DNA sequence comparison problems. These algorithms require computer time proportional to the product of the lengths of the two sequences being compared [O(N2)] but require memory space proportional only to the sum of these lengths [O(N)]. Although the requirement for O(N2) time limits use of the algorithms to the largest computers when searching protein and DNA sequence databases, many other applications of these algorithms, such as calculation of distances for evolutionary trees and comparison of a new sequence to a library of sequence profiles, are well within the capabilities of desktop computers. In particular, the results of library searches with rapid searching programs, such as FASTA or BLAST, should be confirmed by performing a rigorous optimal alignment. Whereas rapid methods do not overlook significant sequence similarities, FASTA limits the number of gaps that can be inserted into an alignment, so that a rigorous alignment may extend the alignment substantially in some cases. BLAST does not allow gaps in the local regions that it reports; a calculation that allows gaps is very likely to extend the alignment substantially. Although a Monte Carlo evaluation of the statistical significance of a similarity score with a rigorous algorithm is much slower than the heuristic approach used by the RDF2 program, the dynamic programming approach should take less than 1 hr on a 386-based PC or desktop Unix workstation. For descriptive purposes, we have limited our discussion to methods for calculating similarity scores and distances that use gap penalties of the form g = rk. Nevertheless, programs for the more general case (g = q+rk) are readily available. Versions of these programs that run either on Unix workstations, IBM-PC class computers, or the Macintosh can be obtained from either of the authors.

Query-seeded iterative sequence similarity searching improves selectivity 5–20-fold

PubMed Central

Li, Weizhong; Lopez, Rodrigo

2017-01-01

Abstract Iterative similarity search programs, like psiblast, jackhmmer, and psisearch, are much more sensitive than pairwise similarity search methods like blast and ssearch because they build a position specific scoring model (a PSSM or HMM) that captures the pattern of sequence conservation characteristic to a protein family. But models are subject to contamination; once an unrelated sequence has been added to the model, homologs of the unrelated sequence will also produce high scores, and the model can diverge from the original protein family. Examination of alignment errors during psiblast PSSM contamination suggested a simple strategy for dramatically reducing PSSM contamination. psiblast PSSMs are built from the query-based multiple sequence alignment (MSA) implied by the pairwise alignments between the query model (PSSM, HMM) and the subject sequences in the library. When the original query sequence residues are inserted into gapped positions in the aligned subject sequence, the resulting PSSM rarely produces alignment over-extensions or alignments to unrelated sequences. This simple step, which tends to anchor the PSSM to the original query sequence and slightly increase target percent identity, can reduce the frequency of false-positive alignments more than 20-fold compared with psiblast and jackhmmer, with little loss in search sensitivity. PMID:27923999

'First 1000 days' health interventions in low- and middle-income countries: alignment of South African policies with high-quality evidence.

PubMed

English, René; Peer, Nazia; Honikman, Simone; Tugendhaft, Aviva; Hofman, Karen J

2017-01-01

In South Africa (SA), despite adoption of international strategies and approaches, maternal, neonatal and child (MNC) morbidity and mortality rates have not sufficiently declined. To conduct an umbrella review (UR) that identifies interventions in low- and middle-income countries, with a high-quality evidence base, that improve MNC morbidity and mortality outcomes within the first 1000 days of life; and to assess the incorporation of the evidence into local strategies, guidelines and documents. We included publications about women and children in the first 1000 days of life; healthcare professionals and community members. Comparators were those who did not receive the intervention. Interventions were pharmacological and non-pharmacological. Outcomes were MNC morbidity and mortality. Authors conducted English language electronic and manual searches (2000-2013). The quality of systematic reviews and meta-analyses (SRs/MAs) were reviewed. Interventions were ranked according to level of evidence; and then aligned with SA strategies, policies and guidelines. A tool to extract data was developed and used by two authors who independently extracted data. Summary measures from MAs or summaries of SRs were reviewed and the specificities of the various interventions listed. A search of all local high-level documents was done and these were assessed to determine the specificities of the recommendations and their alignment to the evidence. In total, 19 interventions presented in 32 SRs were identified. Overall, SA's policymakers have sufficiently included high-quality evidence-based interventions into local policies. However, optimal period of birth spacing (two to five years) is not explicitly promoted nor was ante- and postnatal depression adequately incorporated. Antenatal care visits should be increased from four to about eight according to the evidence. Incorporation of existing evidence into policies can be strengthened in SA. The UR methods are useful to inform policymaking and identify research gaps. RESPONSIBLE EDITOR Nawi Ng, Umeå University, Sweden.

‘First 1000 days’ health interventions in low- and middle-income countries: alignment of South African policies with high-quality evidence

PubMed Central

English, René; Peer, Nazia; Honikman, Simone; Tugendhaft, Aviva; Hofman, Karen J

2017-01-01

ABSTRACT Background: In South Africa (SA), despite adoption of international strategies and approaches, maternal, neonatal and child (MNC) morbidity and mortality rates have not sufficiently declined. Objectives: To conduct an umbrella review (UR) that identifies interventions in low- and middle-income countries, with a high-quality evidence base, that improve MNC morbidity and mortality outcomes within the first 1000 days of life; and to assess the incorporation of the evidence into local strategies, guidelines and documents. Methods: We included publications about women and children in the first 1000 days of life; healthcare professionals and community members. Comparators were those who did not receive the intervention. Interventions were pharmacological and non-pharmacological. Outcomes were MNC morbidity and mortality. Authors conducted English language electronic and manual searches (2000–2013). The quality of systematic reviews and meta-analyses (SRs/MAs) were reviewed. Interventions were ranked according to level of evidence; and then aligned with SA strategies, policies and guidelines. A tool to extract data was developed and used by two authors who independently extracted data. Summary measures from MAs or summaries of SRs were reviewed and the specificities of the various interventions listed. A search of all local high-level documents was done and these were assessed to determine the specificities of the recommendations and their alignment to the evidence. Results: In total, 19 interventions presented in 32 SRs were identified. Overall, SA’s policymakers have sufficiently included high-quality evidence-based interventions into local policies. However, optimal period of birth spacing (two to five years) is not explicitly promoted nor was ante- and postnatal depression adequately incorporated. Antenatal care visits should be increased from four to about eight according to the evidence. Conclusion: Incorporation of existing evidence into policies can be strengthened in SA. The UR methods are useful to inform policymaking and identify research gaps. RESPONSIBLE EDITOR Nawi Ng, Umeå University, Sweden PMID:28715934

Transcriptomic analysis of the autophagy machinery in crustaceans.

PubMed

Suwansa-Ard, Saowaros; Kankuan, Wilairat; Thongbuakaew, Tipsuda; Saetan, Jirawat; Kornthong, Napamanee; Kruangkum, Thanapong; Khornchatri, Kanjana; Cummins, Scott F; Isidoro, Ciro; Sobhon, Prasert

2016-08-09

The giant freshwater prawn, Macrobrachium rosenbergii, is a decapod crustacean that is commercially important as a food source. Farming of commercial crustaceans requires an efficient management strategy because the animals are easily subjected to stress and diseases during the culture. Autophagy, a stress response process, is well-documented and conserved in most animals, yet it is poorly studied in crustaceans. In this study, we have performed an in silico search for transcripts encoding autophagy-related (Atg) proteins within various tissue transcriptomes of M. rosenbergii. Basic Local Alignment Search Tool (BLAST) search using previously known Atg proteins as queries revealed 41 transcripts encoding homologous M. rosenbergii Atg proteins. Among these Atg proteins, we selected commonly used autophagy markers, including Beclin 1, vacuolar protein sorting (Vps) 34, microtubule-associated proteins 1A/1B light chain 3B (MAP1LC3B), p62/sequestosome 1 (SQSTM1), and lysosomal-associated membrane protein 1 (Lamp-1) for further sequence analyses using comparative alignment and protein structural prediction. We found that crustacean autophagy marker proteins contain conserved motifs typical of other animal Atg proteins. Western blotting using commercial antibodies raised against human Atg marker proteins indicated their presence in various M. rosenbergii tissues, while immunohistochemistry localized Atg marker proteins within ovarian tissue, specifically late stage oocytes. This study demonstrates that the molecular components of autophagic process are conserved in crustaceans, which is comparable to autophagic process in mammals. Furthermore, it provides a foundation for further studies of autophagy in crustaceans that may lead to more understanding of the reproduction- and stress-related autophagy, which will enable the efficient aquaculture practices.

PSO-based methods for medical image registration and change assessment of pigmented skin

NASA Astrophysics Data System (ADS)

Kacenjar, Steve; Zook, Matthew; Balint, Michael

2011-03-01

There are various scientific and technological areas in which it is imperative to rapidly detect and quantify changes in imagery over time. In fields such as earth remote sensing, aerospace systems, and medical imaging, searching for timedependent, regional changes across deformable topographies is complicated by varying camera acquisition geometries, lighting environments, background clutter conditions, and occlusion. Under these constantly-fluctuating conditions, the use of standard, rigid-body registration approaches often fail to provide sufficient fidelity to overlay image scenes together. This is problematic because incorrect assessments of the underlying changes of high-level topography can result in systematic errors in the quantification and classification of interested areas. For example, in the current naked-eye detection strategies of melanoma, a dermatologist often uses static morphological attributes to identify suspicious skin lesions for biopsy. This approach does not incorporate temporal changes which suggest malignant degeneration. By performing the co-registration of time-separated skin imagery, a dermatologist may more effectively detect and identify early morphological changes in pigmented lesions; enabling the physician to detect cancers at an earlier stage resulting in decreased morbidity and mortality. This paper describes an image processing system which will be used to detect changes in the characteristics of skin lesions over time. The proposed system consists of three main functional elements: 1.) coarse alignment of timesequenced imagery, 2.) refined alignment of local skin topographies, and 3.) assessment of local changes in lesion size. During the coarse alignment process, various approaches can be used to obtain a rough alignment, including: 1.) a manual landmark/intensity-based registration method1, and 2.) several flavors of autonomous optical matched filter methods2. These procedures result in the rough alignment of a patient's back topography. Since the skin is a deformable membrane, this process only provides an initial condition for subsequent refinements in aligning the localized topography of the skin. To achieve a refined enhancement, a Particle Swarm Optimizer (PSO) is used to optimally determine the local camera models associated with a generalized geometric transform. Here the optimization process is driven using the minimization of entropy between the multiple time-separated images. Once the camera models are corrected for local skin deformations, the images are compared using both pixel-based and regional-based methods. Limits on the detectability of change are established by the fidelity to which the algorithm corrects for local skin deformation and background alterations. These limits provide essential information in establishing early-warning thresholds for Melanoma detection. Key to this work is the development of a PSO alignment algorithm to perform the refined alignment in local skin topography between the time sequenced imagery (TSI). Test and validation of this alignment process is achieved using a forward model producing known geometric artifacts in the images and afterwards using a PSO algorithm to demonstrate the ability to identify and correct for these artifacts. Specifically, the forward model introduces local translational, rotational, and magnification changes within the image. These geometric modifiers are expected during TSI acquisition because of logistical issues to precisely align the patient to the image recording geometry and is therefore of paramount importance to any viable image registration system. This paper shows that the PSO alignment algorithm is effective in autonomously determining and mitigating these geometric modifiers. The degree of efficacy is measured by several statistically and morphologically based pre-image filtering operations applied to the TSI imagery before applying the PSO alignment algorithm. These trade studies show that global image threshold binarization provides rapid and superior convergence characteristics relative to that of morphologically based methods.

BLAST and FASTA similarity searching for multiple sequence alignment.

PubMed

Pearson, William R

2014-01-01

BLAST, FASTA, and other similarity searching programs seek to identify homologous proteins and DNA sequences based on excess sequence similarity. If two sequences share much more similarity than expected by chance, the simplest explanation for the excess similarity is common ancestry-homology. The most effective similarity searches compare protein sequences, rather than DNA sequences, for sequences that encode proteins, and use expectation values, rather than percent identity, to infer homology. The BLAST and FASTA packages of sequence comparison programs provide programs for comparing protein and DNA sequences to protein databases (the most sensitive searches). Protein and translated-DNA comparisons to protein databases routinely allow evolutionary look back times from 1 to 2 billion years; DNA:DNA searches are 5-10-fold less sensitive. BLAST and FASTA can be run on popular web sites, but can also be downloaded and installed on local computers. With local installation, target databases can be customized for the sequence data being characterized. With today's very large protein databases, search sensitivity can also be improved by searching smaller comprehensive databases, for example, a complete protein set from an evolutionarily neighboring model organism. By default, BLAST and FASTA use scoring strategies target for distant evolutionary relationships; for comparisons involving short domains or queries, or searches that seek relatively close homologs (e.g. mouse-human), shallower scoring matrices will be more effective. Both BLAST and FASTA provide very accurate statistical estimates, which can be used to reliably identify protein sequences that diverged more than 2 billion years ago.

The benefits of adaptive parametrization in multi-objective Tabu Search optimization

NASA Astrophysics Data System (ADS)

Ghisu, Tiziano; Parks, Geoffrey T.; Jaeggi, Daniel M.; Jarrett, Jerome P.; Clarkson, P. John

2010-10-01

In real-world optimization problems, large design spaces and conflicting objectives are often combined with a large number of constraints, resulting in a highly multi-modal, challenging, fragmented landscape. The local search at the heart of Tabu Search, while being one of its strengths in highly constrained optimization problems, requires a large number of evaluations per optimization step. In this work, a modification of the pattern search algorithm is proposed: this modification, based on a Principal Components' Analysis of the approximation set, allows both a re-alignment of the search directions, thereby creating a more effective parametrization, and also an informed reduction of the size of the design space itself. These changes make the optimization process more computationally efficient and more effective - higher quality solutions are identified in fewer iterations. These advantages are demonstrated on a number of standard analytical test functions (from the ZDT and DTLZ families) and on a real-world problem (the optimization of an axial compressor preliminary design).

Non-lethal sampling for the detection of Myxobolus cerebralis in asymptomatic rainbow trout

USGS Publications Warehouse

Schill, Bane; Waldrop, Thomas; Densmore, Christine; Blazer, Vicki

1999-01-01

We have described in previous reports (Schill et al., 1998) the development of a polymerase chain reaction (PCR) amplification of 18S ribosomal RNA for the detection of Myxozoan parasites. Oligonucleotide primers were developed by multiple alignment of Myxozoan sequence information and analysis by a custom-written computer program (PRIM). Candidate pairs of primer sequences were then analyzed for specificity by BLAST (Basic Local Alignment Search Tool). From these, a set of promising primers (MYXFWD and MYXREV) was chosen for further testing. These were chosen because they should direct detection of a number of Myxozoan species (Table 1). PCR using MXYFWD and MYXREV proved to be robust and relatively free of artifact products. Further, we were able to routinely detect Myxobolus cerebralis in fish tissues (Figure 1).

xHMMER3x2: Utilizing HMMER3's speed and HMMER2's sensitivity and specificity in the glocal alignment mode for improved large-scale protein domain annotation.

PubMed

Yap, Choon-Kong; Eisenhaber, Birgit; Eisenhaber, Frank; Wong, Wing-Cheong

2016-11-29

While the local-mode HMMER3 is notable for its massive speed improvement, the slower glocal-mode HMMER2 is more exact for domain annotation by enforcing full domain-to-sequence alignments. Since a unit of domain necessarily implies a unit of function, local-mode HMMER3 alone remains insufficient for precise function annotation tasks. In addition, the incomparable E-values for the same domain model by different HMMER builds create difficulty when checking for domain annotation consistency on a large-scale basis. In this work, both the speed of HMMER3 and glocal-mode alignment of HMMER2 are combined within the xHMMER3x2 framework for tackling the large-scale domain annotation task. Briefly, HMMER3 is utilized for initial domain detection so that HMMER2 can subsequently perform the glocal-mode, sequence-to-full-domain alignments for the detected HMMER3 hits. An E-value calibration procedure is required to ensure that the search space by HMMER2 is sufficiently replicated by HMMER3. We find that the latter is straightforwardly possible for ~80% of the models in the Pfam domain library (release 29). However in the case of the remaining ~20% of HMMER3 domain models, the respective HMMER2 counterparts are more sensitive. Thus, HMMER3 searches alone are insufficient to ensure sensitivity and a HMMER2-based search needs to be initiated. When tested on the set of UniProt human sequences, xHMMER3x2 can be configured to be between 7× and 201× faster than HMMER2, but with descending domain detection sensitivity from 99.8 to 95.7% with respect to HMMER2 alone; HMMER3's sensitivity was 95.7%. At extremes, xHMMER3x2 is either the slow glocal-mode HMMER2 or the fast HMMER3 with glocal-mode. Finally, the E-values to false-positive rates (FPR) mapping by xHMMER3x2 allows E-values of different model builds to be compared, so that any annotation discrepancies in a large-scale annotation exercise can be flagged for further examination by dissectHMMER. The xHMMER3x2 workflow allows large-scale domain annotation speed to be drastically improved over HMMER2 without compromising for domain-detection with regard to sensitivity and sequence-to-domain alignment incompleteness. The xHMMER3x2 code and its webserver (for Pfam release 27, 28 and 29) are freely available at http://xhmmer3x2.bii.a-star.edu.sg/ . Reviewed by Thomas Dandekar, L. Aravind, Oliviero Carugo and Shamil Sunyaev. For the full reviews, please go to the Reviewers' comments section.

Accuracy in breast shape alignment with 3D surface fitting algorithms.

PubMed

Riboldi, Marco; Gierga, David P; Chen, George T Y; Baroni, Guido

2009-04-01

Surface imaging is in use in radiotherapy clinical practice for patient setup optimization and monitoring. Breast alignment is accomplished by searching for a tentative spatial correspondence between the reference and daily surface shape models. In this study, the authors quantify whole breast shape alignment by relying on texture features digitized on 3D surface models. Texture feature localization was validated through repeated measurements in a silicone breast phantom, mounted on a high precision mechanical stage. Clinical investigations on breast shape alignment included 133 fractions in 18 patients treated with accelerated partial breast irradiation. The breast shape was detected with a 3D video based surface imaging system so that breathing was compensated. An in-house algorithm for breast alignment, based on surface fitting constrained by nipple matching (constrained surface fitting), was applied. Results were compared with a commercial software where no constraints are utilized (unconstrained surface fitting). Texture feature localization was validated within 2 mm in each anatomical direction. Clinical data show that unconstrained surface fitting achieves adequate accuracy in most cases, though nipple mismatch is considerably higher than residual surface distances (3.9 mm vs 0.6 mm on average). Outliers beyond 1 cm can be experienced as the result of a degenerate surface fit, where unconstrained surface fitting is not sufficient to establish spatial correspondence. In the constrained surface fitting algorithm, average surface mismatch within 1 mm was obtained when nipple position was forced to match in the [1.5; 5] mm range. In conclusion, optimal results can be obtained by trading off the desired overall surface congruence vs matching of selected landmarks (constraint). Constrained surface fitting is put forward to represent an improvement in setup accuracy for those applications where whole breast positional reproducibility is an issue.

CUDASW++ 3.0: accelerating Smith-Waterman protein database search by coupling CPU and GPU SIMD instructions.

PubMed

Liu, Yongchao; Wirawan, Adrianto; Schmidt, Bertil

2013-04-04

The maximal sensitivity for local alignments makes the Smith-Waterman algorithm a popular choice for protein sequence database search based on pairwise alignment. However, the algorithm is compute-intensive due to a quadratic time complexity. Corresponding runtimes are further compounded by the rapid growth of sequence databases. We present CUDASW++ 3.0, a fast Smith-Waterman protein database search algorithm, which couples CPU and GPU SIMD instructions and carries out concurrent CPU and GPU computations. For the CPU computation, this algorithm employs SSE-based vector execution units as accelerators. For the GPU computation, we have investigated for the first time a GPU SIMD parallelization, which employs CUDA PTX SIMD video instructions to gain more data parallelism beyond the SIMT execution model. Moreover, sequence alignment workloads are automatically distributed over CPUs and GPUs based on their respective compute capabilities. Evaluation on the Swiss-Prot database shows that CUDASW++ 3.0 gains a performance improvement over CUDASW++ 2.0 up to 2.9 and 3.2, with a maximum performance of 119.0 and 185.6 GCUPS, on a single-GPU GeForce GTX 680 and a dual-GPU GeForce GTX 690 graphics card, respectively. In addition, our algorithm has demonstrated significant speedups over other top-performing tools: SWIPE and BLAST+. CUDASW++ 3.0 is written in CUDA C++ and PTX assembly languages, targeting GPUs based on the Kepler architecture. This algorithm obtains significant speedups over its predecessor: CUDASW++ 2.0, by benefiting from the use of CPU and GPU SIMD instructions as well as the concurrent execution on CPUs and GPUs. The source code and the simulated data are available at http://cudasw.sourceforge.net.

Protein 3D Structure and Electron Microscopy Map Retrieval Using 3D-SURFER2.0 and EM-SURFER.

PubMed

Han, Xusi; Wei, Qing; Kihara, Daisuke

2017-12-08

With the rapid growth in the number of solved protein structures stored in the Protein Data Bank (PDB) and the Electron Microscopy Data Bank (EMDB), it is essential to develop tools to perform real-time structure similarity searches against the entire structure database. Since conventional structure alignment methods need to sample different orientations of proteins in the three-dimensional space, they are time consuming and unsuitable for rapid, real-time database searches. To this end, we have developed 3D-SURFER and EM-SURFER, which utilize 3D Zernike descriptors (3DZD) to conduct high-throughput protein structure comparison, visualization, and analysis. Taking an atomic structure or an electron microscopy map of a protein or a protein complex as input, the 3DZD of a query protein is computed and compared with the 3DZD of all other proteins in PDB or EMDB. In addition, local geometrical characteristics of a query protein can be analyzed using VisGrid and LIGSITE CSC in 3D-SURFER. This article describes how to use 3D-SURFER and EM-SURFER to carry out protein surface shape similarity searches, local geometric feature analysis, and interpretation of the search results. © 2017 by John Wiley & Sons, Inc. Copyright © 2017 John Wiley & Sons, Inc.

PCV: An Alignment Free Method for Finding Homologous Nucleotide Sequences and its Application in Phylogenetic Study.

PubMed

Kumar, Rajnish; Mishra, Bharat Kumar; Lahiri, Tapobrata; Kumar, Gautam; Kumar, Nilesh; Gupta, Rahul; Pal, Manoj Kumar

2017-06-01

Online retrieval of the homologous nucleotide sequences through existing alignment techniques is a common practice against the given database of sequences. The salient point of these techniques is their dependence on local alignment techniques and scoring matrices the reliability of which is limited by computational complexity and accuracy. Toward this direction, this work offers a novel way for numerical representation of genes which can further help in dividing the data space into smaller partitions helping formation of a search tree. In this context, this paper introduces a 36-dimensional Periodicity Count Value (PCV) which is representative of a particular nucleotide sequence and created through adaptation from the concept of stochastic model of Kolekar et al. (American Institute of Physics 1298:307-312, 2010. doi: 10.1063/1.3516320 ). The PCV construct uses information on physicochemical properties of nucleotides and their positional distribution pattern within a gene. It is observed that PCV representation of gene reduces computational cost in the calculation of distances between a pair of genes while being consistent with the existing methods. The validity of PCV-based method was further tested through their use in molecular phylogeny constructs in comparison with that using existing sequence alignment methods.

Improved alignment evaluation and optimization : final report.

DOT National Transportation Integrated Search

2007-09-11

This report outlines the development of an enhanced highway alignment evaluation and optimization : model. A GIS-based software tool is prepared for alignment optimization that uses genetic algorithms for : optimal search. The software is capable of ...

Searching for gravitational waves from compact binaries with precessing spins

NASA Astrophysics Data System (ADS)

Harry, Ian; Privitera, Stephen; Bohé, Alejandro; Buonanno, Alessandra

2016-07-01

Current searches for gravitational waves from compact-object binaries with the LIGO and Virgo observatories employ waveform models with spins aligned (or antialigned) with the orbital angular momentum. Here, we derive a new statistic to search for compact objects carrying generic (precessing) spins. Applying this statistic, we construct banks of both aligned- and generic-spin templates for binary black holes and neutron star-black hole binaries, and compare the effectualness of these banks towards simulated populations of generic-spin systems. We then use these banks in a pipeline analysis of Gaussian noise to measure the increase in background incurred by using generic- instead of aligned-spin banks. Although the generic-spin banks have roughly a factor of ten more templates than the aligned-spin banks, we find an overall improvement in signal recovery at a fixed false-alarm rate for systems with high-mass ratio and highly precessing spins. This gain in sensitivity comes at a small loss of sensitivity (≲4 %) for systems that are already well covered by aligned-spin templates. Since the observation of even a single binary merger with misaligned spins could provide unique astrophysical insights into the formation of these sources, we recommend that the method described here be developed further to mount a viable search for generic-spin binary mergers in LIGO/Virgo data.

Improve homology search sensitivity of PacBio data by correcting frameshifts.

PubMed

Du, Nan; Sun, Yanni

2016-09-01

Single-molecule, real-time sequencing (SMRT) developed by Pacific BioSciences produces longer reads than secondary generation sequencing technologies such as Illumina. The long read length enables PacBio sequencing to close gaps in genome assembly, reveal structural variations, and identify gene isoforms with higher accuracy in transcriptomic sequencing. However, PacBio data has high sequencing error rate and most of the errors are insertion or deletion errors. During alignment-based homology search, insertion or deletion errors in genes will cause frameshifts and may only lead to marginal alignment scores and short alignments. As a result, it is hard to distinguish true alignments from random alignments and the ambiguity will incur errors in structural and functional annotation. Existing frameshift correction tools are designed for data with much lower error rate and are not optimized for PacBio data. As an increasing number of groups are using SMRT, there is an urgent need for dedicated homology search tools for PacBio data. In this work, we introduce Frame-Pro, a profile homology search tool for PacBio reads. Our tool corrects sequencing errors and also outputs the profile alignments of the corrected sequences against characterized protein families. We applied our tool to both simulated and real PacBio data. The results showed that our method enables more sensitive homology search, especially for PacBio data sets of low sequencing coverage. In addition, we can correct more errors when comparing with a popular error correction tool that does not rely on hybrid sequencing. The source code is freely available at https://sourceforge.net/projects/frame-pro/ yannisun@msu.edu. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

PF2fit: Polar Fast Fourier Matched Alignment of Atomistic Structures with 3D Electron Microscopy Maps.

PubMed

Bettadapura, Radhakrishna; Rasheed, Muhibur; Vollrath, Antje; Bajaj, Chandrajit

2015-10-01

There continue to be increasing occurrences of both atomistic structure models in the PDB (possibly reconstructed from X-ray diffraction or NMR data), and 3D reconstructed cryo-electron microscopy (3D EM) maps (albeit at coarser resolution) of the same or homologous molecule or molecular assembly, deposited in the EMDB. To obtain the best possible structural model of the molecule at the best achievable resolution, and without any missing gaps, one typically aligns (match and fits) the atomistic structure model with the 3D EM map. We discuss a new algorithm and generalized framework, named PF(2) fit (Polar Fast Fourier Fitting) for the best possible structural alignment of atomistic structures with 3D EM. While PF(2) fit enables only a rigid, six dimensional (6D) alignment method, it augments prior work on 6D X-ray structure and 3D EM alignment in multiple ways: Scoring. PF(2) fit includes a new scoring scheme that, in addition to rewarding overlaps between the volumes occupied by the atomistic structure and 3D EM map, rewards overlaps between the volumes complementary to them. We quantitatively demonstrate how this new complementary scoring scheme improves upon existing approaches. PF(2) fit also includes two scoring functions, the non-uniform exterior penalty and the skeleton-secondary structure score, and implements the scattering potential score as an alternative to traditional Gaussian blurring. Search. PF(2) fit utilizes a fast polar Fourier search scheme, whose main advantage is the ability to search over uniformly and adaptively sampled subsets of the space of rigid-body motions. PF(2) fit also implements a new reranking search and scoring methodology that considerably improves alignment metrics in results obtained from the initial search.

PF2 fit: Polar Fast Fourier Matched Alignment of Atomistic Structures with 3D Electron Microscopy Maps

PubMed Central

Bettadapura, Radhakrishna; Rasheed, Muhibur; Vollrath, Antje; Bajaj, Chandrajit

2015-01-01

There continue to be increasing occurrences of both atomistic structure models in the PDB (possibly reconstructed from X-ray diffraction or NMR data), and 3D reconstructed cryo-electron microscopy (3D EM) maps (albeit at coarser resolution) of the same or homologous molecule or molecular assembly, deposited in the EMDB. To obtain the best possible structural model of the molecule at the best achievable resolution, and without any missing gaps, one typically aligns (match and fits) the atomistic structure model with the 3D EM map. We discuss a new algorithm and generalized framework, named PF2 fit (Polar Fast Fourier Fitting) for the best possible structural alignment of atomistic structures with 3D EM. While PF2 fit enables only a rigid, six dimensional (6D) alignment method, it augments prior work on 6D X-ray structure and 3D EM alignment in multiple ways: Scoring. PF2 fit includes a new scoring scheme that, in addition to rewarding overlaps between the volumes occupied by the atomistic structure and 3D EM map, rewards overlaps between the volumes complementary to them. We quantitatively demonstrate how this new complementary scoring scheme improves upon existing approaches. PF2 fit also includes two scoring functions, the non-uniform exterior penalty and the skeleton-secondary structure score, and implements the scattering potential score as an alternative to traditional Gaussian blurring. Search. PF2 fit utilizes a fast polar Fourier search scheme, whose main advantage is the ability to search over uniformly and adaptively sampled subsets of the space of rigid-body motions. PF2 fit also implements a new reranking search and scoring methodology that considerably improves alignment metrics in results obtained from the initial search. PMID:26469938

Fast online and index-based algorithms for approximate search of RNA sequence-structure patterns

PubMed Central

2013-01-01

Background It is well known that the search for homologous RNAs is more effective if both sequence and structure information is incorporated into the search. However, current tools for searching with RNA sequence-structure patterns cannot fully handle mutations occurring on both these levels or are simply not fast enough for searching large sequence databases because of the high computational costs of the underlying sequence-structure alignment problem. Results We present new fast index-based and online algorithms for approximate matching of RNA sequence-structure patterns supporting a full set of edit operations on single bases and base pairs. Our methods efficiently compute semi-global alignments of structural RNA patterns and substrings of the target sequence whose costs satisfy a user-defined sequence-structure edit distance threshold. For this purpose, we introduce a new computing scheme to optimally reuse the entries of the required dynamic programming matrices for all substrings and combine it with a technique for avoiding the alignment computation of non-matching substrings. Our new index-based methods exploit suffix arrays preprocessed from the target database and achieve running times that are sublinear in the size of the searched sequences. To support the description of RNA molecules that fold into complex secondary structures with multiple ordered sequence-structure patterns, we use fast algorithms for the local or global chaining of approximate sequence-structure pattern matches. The chaining step removes spurious matches from the set of intermediate results, in particular of patterns with little specificity. In benchmark experiments on the Rfam database, our improved online algorithm is faster than the best previous method by up to factor 45. Our best new index-based algorithm achieves a speedup of factor 560. Conclusions The presented methods achieve considerable speedups compared to the best previous method. This, together with the expected sublinear running time of the presented index-based algorithms, allows for the first time approximate matching of RNA sequence-structure patterns in large sequence databases. Beyond the algorithmic contributions, we provide with RaligNAtor a robust and well documented open-source software package implementing the algorithms presented in this manuscript. The RaligNAtor software is available at http://www.zbh.uni-hamburg.de/ralignator. PMID:23865810

SANSparallel: interactive homology search against Uniprot

PubMed Central

Somervuo, Panu; Holm, Liisa

2015-01-01

Proteins evolve by mutations and natural selection. The network of sequence similarities is a rich source for mining homologous relationships that inform on protein structure and function. There are many servers available to browse the network of homology relationships but one has to wait up to a minute for results. The SANSparallel webserver provides protein sequence database searches with immediate response and professional alignment visualization by third-party software. The output is a list, pairwise alignment or stacked alignment of sequence-similar proteins from Uniprot, UniRef90/50, Swissprot or Protein Data Bank. The stacked alignments are viewed in Jalview or as sequence logos. The database search uses the suffix array neighborhood search (SANS) method, which has been re-implemented as a client-server, improved and parallelized. The method is extremely fast and as sensitive as BLAST above 50% sequence identity. Benchmarks show that the method is highly competitive compared to previously published fast database search programs: UBLAST, DIAMOND, LAST, LAMBDA, RAPSEARCH2 and BLAT. The web server can be accessed interactively or programmatically at http://ekhidna2.biocenter.helsinki.fi/cgi-bin/sans/sans.cgi. It can be used to make protein functional annotation pipelines more efficient, and it is useful in interactive exploration of the detailed evidence supporting the annotation of particular proteins of interest. PMID:25855811

Assignment of protein sequences to existing domain and family classification systems: Pfam and the PDB.

PubMed

Xu, Qifang; Dunbrack, Roland L

2012-11-01

Automating the assignment of existing domain and protein family classifications to new sets of sequences is an important task. Current methods often miss assignments because remote relationships fail to achieve statistical significance. Some assignments are not as long as the actual domain definitions because local alignment methods often cut alignments short. Long insertions in query sequences often erroneously result in two copies of the domain assigned to the query. Divergent repeat sequences in proteins are often missed. We have developed a multilevel procedure to produce nearly complete assignments of protein families of an existing classification system to a large set of sequences. We apply this to the task of assigning Pfam domains to sequences and structures in the Protein Data Bank (PDB). We found that HHsearch alignments frequently scored more remotely related Pfams in Pfam clans higher than closely related Pfams, thus, leading to erroneous assignment at the Pfam family level. A greedy algorithm allowing for partial overlaps was, thus, applied first to sequence/HMM alignments, then HMM-HMM alignments and then structure alignments, taking care to join partial alignments split by large insertions into single-domain assignments. Additional assignment of repeat Pfams with weaker E-values was allowed after stronger assignments of the repeat HMM. Our database of assignments, presented in a database called PDBfam, contains Pfams for 99.4% of chains >50 residues. The Pfam assignment data in PDBfam are available at http://dunbrack2.fccc.edu/ProtCid/PDBfam, which can be searched by PDB codes and Pfam identifiers. They will be updated regularly.

CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment

PubMed Central

Manavski, Svetlin A; Valle, Giorgio

2008-01-01

Background Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more than 25 years. It is based on a dynamic programming approach that explores all the possible alignments between two sequences; as a result it returns the optimal local alignment. Unfortunately, the computational cost is very high, requiring a number of operations proportional to the product of the length of two sequences. Furthermore, the exponential growth of protein and DNA databases makes the Smith-Waterman algorithm unrealistic for searching similarities in large sets of sequences. For these reasons heuristic approaches such as those implemented in FASTA and BLAST tend to be preferred, allowing faster execution times at the cost of reduced sensitivity. The main motivation of our work is to exploit the huge computational power of commonly available graphic cards, to develop high performance solutions for sequence alignment. Results In this paper we present what we believe is the fastest solution of the exact Smith-Waterman algorithm running on commodity hardware. It is implemented in the recently released CUDA programming environment by NVidia. CUDA allows direct access to the hardware primitives of the last-generation Graphics Processing Units (GPU) G80. Speeds of more than 3.5 GCUPS (Giga Cell Updates Per Second) are achieved on a workstation running two GeForce 8800 GTX. Exhaustive tests have been done to compare our implementation to SSEARCH and BLAST, running on a 3 GHz Intel Pentium IV processor. Our solution was also compared to a recently published GPU implementation and to a Single Instruction Multiple Data (SIMD) solution. These tests show that our implementation performs from 2 to 30 times faster than any other previous attempt available on commodity hardware. Conclusions The results show that graphic cards are now sufficiently advanced to be used as efficient hardware accelerators for sequence alignment. Their performance is better than any alternative available on commodity hardware platforms. The solution presented in this paper allows large scale alignments to be performed at low cost, using the exact Smith-Waterman algorithm instead of the largely adopted heuristic approaches. PMID:18387198

Comparative modeling without implicit sequence alignments.

PubMed

Kolinski, Andrzej; Gront, Dominik

2007-10-01

The number of known protein sequences is about thousand times larger than the number of experimentally solved 3D structures. For more than half of the protein sequences a close or distant structural analog could be identified. The key starting point in a classical comparative modeling is to generate the best possible sequence alignment with a template or templates. With decreasing sequence similarity, the number of errors in the alignments increases and these errors are the main causes of the decreasing accuracy of the molecular models generated. Here we propose a new approach to comparative modeling, which does not require the implicit alignment - the model building phase explores geometric, evolutionary and physical properties of a template (or templates). The proposed method requires prior identification of a template, although the initial sequence alignment is ignored. The model is built using a very efficient reduced representation search engine CABS to find the best possible superposition of the query protein onto the template represented as a 3D multi-featured scaffold. The criteria used include: sequence similarity, predicted secondary structure consistency, local geometric features and hydrophobicity profile. For more difficult cases, the new method qualitatively outperforms existing schemes of comparative modeling. The algorithm unifies de novo modeling, 3D threading and sequence-based methods. The main idea is general and could be easily combined with other efficient modeling tools as Rosetta, UNRES and others.

Search algorithm complexity modeling with application to image alignment and matching

NASA Astrophysics Data System (ADS)

DelMarco, Stephen

2014-05-01

Search algorithm complexity modeling, in the form of penetration rate estimation, provides a useful way to estimate search efficiency in application domains which involve searching over a hypothesis space of reference templates or models, as in model-based object recognition, automatic target recognition, and biometric recognition. The penetration rate quantifies the expected portion of the database that must be searched, and is useful for estimating search algorithm computational requirements. In this paper we perform mathematical modeling to derive general equations for penetration rate estimates that are applicable to a wide range of recognition problems. We extend previous penetration rate analyses to use more general probabilistic modeling assumptions. In particular we provide penetration rate equations within the framework of a model-based image alignment application domain in which a prioritized hierarchical grid search is used to rank subspace bins based on matching probability. We derive general equations, and provide special cases based on simplifying assumptions. We show how previously-derived penetration rate equations are special cases of the general formulation. We apply the analysis to model-based logo image alignment in which a hierarchical grid search is used over a geometric misalignment transform hypothesis space. We present numerical results validating the modeling assumptions and derived formulation.

DISCO: Distance and Spectrum Correlation Optimization Alignment for Two Dimensional Gas Chromatography Time-of-Flight Mass Spectrometry-based Metabolomics

PubMed Central

Wang, Bing; Fang, Aiqin; Heim, John; Bogdanov, Bogdan; Pugh, Scott; Libardoni, Mark; Zhang, Xiang

2010-01-01

A novel peak alignment algorithm using a distance and spectrum correlation optimization (DISCO) method has been developed for two-dimensional gas chromatography time-of-flight mass spectrometry (GC×GC/TOF-MS) based metabolomics. This algorithm uses the output of the instrument control software, ChromaTOF, as its input data. It detects and merges multiple peak entries of the same metabolite into one peak entry in each input peak list. After a z-score transformation of metabolite retention times, DISCO selects landmark peaks from all samples based on both two-dimensional retention times and mass spectrum similarity of fragment ions measured by Pearson’s correlation coefficient. A local linear fitting method is employed in the original two-dimensional retention time space to correct retention time shifts. A progressive retention time map searching method is used to align metabolite peaks in all samples together based on optimization of the Euclidean distance and mass spectrum similarity. The effectiveness of the DISCO algorithm is demonstrated using data sets acquired under different experiment conditions and a spiked-in experiment. PMID:20476746

An efficient algorithm for pairwise local alignment of protein interaction networks

DOE PAGES

Chen, Wenbin; Schmidt, Matthew; Tian, Wenhong; ...

2015-04-01

Recently, researchers seeking to understand, modify, and create beneficial traits in organisms have looked for evolutionarily conserved patterns of protein interactions. Their conservation likely means that the proteins of these conserved functional modules are important to the trait's expression. In this paper, we formulate the problem of identifying these conserved patterns as a graph optimization problem, and develop a fast heuristic algorithm for this problem. We compare the performance of our network alignment algorithm to that of the MaWISh algorithm [Koyuturk M, Kim Y, Topkara U, Subramaniam S, Szpankowski W, Grama A, Pairwise alignment of protein interaction networks, J Computmore » Biol 13(2): 182-199, 2006.], which bases its search algorithm on a related decision problem formulation. We find that our algorithm discovers conserved modules with a larger number of proteins in an order of magnitude less time. In conclusion, the protein sets found by our algorithm correspond to known conserved functional modules at comparable precision and recall rates as those produced by the MaWISh algorithm.« less

Face Alignment via Regressing Local Binary Features.

PubMed

Ren, Shaoqing; Cao, Xudong; Wei, Yichen; Sun, Jian

2016-03-01

This paper presents a highly efficient and accurate regression approach for face alignment. Our approach has two novel components: 1) a set of local binary features and 2) a locality principle for learning those features. The locality principle guides us to learn a set of highly discriminative local binary features for each facial landmark independently. The obtained local binary features are used to jointly learn a linear regression for the final output. This approach achieves the state-of-the-art results when tested on the most challenging benchmarks to date. Furthermore, because extracting and regressing local binary features are computationally very cheap, our system is much faster than previous methods. It achieves over 3000 frames per second (FPS) on a desktop or 300 FPS on a mobile phone for locating a few dozens of landmarks. We also study a key issue that is important but has received little attention in the previous research, which is the face detector used to initialize alignment. We investigate several face detectors and perform quantitative evaluation on how they affect alignment accuracy. We find that an alignment friendly detector can further greatly boost the accuracy of our alignment method, reducing the error up to 16% relatively. To facilitate practical usage of face detection/alignment methods, we also propose a convenient metric to measure how good a detector is for alignment initialization.

Gravitational wave searches for aligned-spin binary neutron stars using nonspinning templates

NASA Astrophysics Data System (ADS)

Cho, Hee-Suk; Lee, Chang-Hwan

2018-01-01

We study gravitational wave searches for merging binary neutron stars (NSs). We use nonspinning template waveforms towards the signals emitted from aligned-spin NS-NS binaries, in which the spins of the NSs are aligned with the orbital angular momentum. We use the TaylorF2 waveform model, which can generate inspiral waveforms emitted from aligned-spin compact binaries. We employ the single effective spin parameter χeff to represent the effect of two component spins (χ1, χ2) on the wave function. For a target system, we choose a binary consisting of the same component masses of 1.4 M ⊙ and consider the spins up to χ i = 0.4. We investigate fitting factors of the nonspinning templates to evaluate their efficiency in gravitational wave searches for the aligned-spin NS-NS binaries. We find that the templates can achieve the fitting factors exceeding 0.97 only for the signals in the range of -0.2 ≲ χeff ≲ 0. Therefore, we demonstrate the necessity of using aligned-spin templates not to lose the signals outside that range. We also show how much the recovered total mass can be biased from the true value depending on the spin of the signal.

Collective dynamics of soft active particles

NASA Astrophysics Data System (ADS)

van Drongelen, Ruben; Pal, Anshuman; Goodrich, Carl P.; Idema, Timon

2015-03-01

We present a model of soft active particles that leads to a rich array of collective behavior found also in dense biological swarms of bacteria and other unicellular organisms. Our model uses only local interactions, such as Vicsek-type nearest-neighbor alignment, short-range repulsion, and a local boundary term. Changing the relative strength of these interactions leads to migrating swarms, rotating swarms, and jammed swarms, as well as swarms that exhibit run-and-tumble motion, alternating between migration and either rotating or jammed states. Interestingly, although a migrating swarm moves slower than an individual particle, the diffusion constant can be up to three orders of magnitude larger, suggesting that collective motion can be highly advantageous, for example, when searching for food.

Profile-Based LC-MS Data Alignment—A Bayesian Approach

PubMed Central

Tsai, Tsung-Heng; Tadesse, Mahlet G.; Wang, Yue; Ressom, Habtom W.

2014-01-01

A Bayesian alignment model (BAM) is proposed for alignment of liquid chromatography-mass spectrometry (LC-MS) data. BAM belongs to the category of profile-based approaches, which are composed of two major components: a prototype function and a set of mapping functions. Appropriate estimation of these functions is crucial for good alignment results. BAM uses Markov chain Monte Carlo (MCMC) methods to draw inference on the model parameters and improves on existing MCMC-based alignment methods through 1) the implementation of an efficient MCMC sampler and 2) an adaptive selection of knots. A block Metropolis-Hastings algorithm that mitigates the problem of the MCMC sampler getting stuck at local modes of the posterior distribution is used for the update of the mapping function coefficients. In addition, a stochastic search variable selection (SSVS) methodology is used to determine the number and positions of knots. We applied BAM to a simulated data set, an LC-MS proteomic data set, and two LC-MS metabolomic data sets, and compared its performance with the Bayesian hierarchical curve registration (BHCR) model, the dynamic time-warping (DTW) model, and the continuous profile model (CPM). The advantage of applying appropriate profile-based retention time correction prior to performing a feature-based approach is also demonstrated through the metabolomic data sets. PMID:23929872

H-BLAST: a fast protein sequence alignment toolkit on heterogeneous computers with GPUs.

PubMed

Ye, Weicai; Chen, Ying; Zhang, Yongdong; Xu, Yuesheng

2017-04-15

The sequence alignment is a fundamental problem in bioinformatics. BLAST is a routinely used tool for this purpose with over 118 000 citations in the past two decades. As the size of bio-sequence databases grows exponentially, the computational speed of alignment softwares must be improved. We develop the heterogeneous BLAST (H-BLAST), a fast parallel search tool for a heterogeneous computer that couples CPUs and GPUs, to accelerate BLASTX and BLASTP-basic tools of NCBI-BLAST. H-BLAST employs a locally decoupled seed-extension algorithm for better performance on GPUs, and offers a performance tuning mechanism for better efficiency among various CPUs and GPUs combinations. H-BLAST produces identical alignment results as NCBI-BLAST and its computational speed is much faster than that of NCBI-BLAST. Speedups achieved by H-BLAST over sequential NCBI-BLASTP (resp. NCBI-BLASTX) range mostly from 4 to 10 (resp. 5 to 7.2). With 2 CPU threads and 2 GPUs, H-BLAST can be faster than 16-threaded NCBI-BLASTX. Furthermore, H-BLAST is 1.5-4 times faster than GPU-BLAST. https://github.com/Yeyke/H-BLAST.git. yux06@syr.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

SANSparallel: interactive homology search against Uniprot.

PubMed

Somervuo, Panu; Holm, Liisa

2015-07-01

Proteins evolve by mutations and natural selection. The network of sequence similarities is a rich source for mining homologous relationships that inform on protein structure and function. There are many servers available to browse the network of homology relationships but one has to wait up to a minute for results. The SANSparallel webserver provides protein sequence database searches with immediate response and professional alignment visualization by third-party software. The output is a list, pairwise alignment or stacked alignment of sequence-similar proteins from Uniprot, UniRef90/50, Swissprot or Protein Data Bank. The stacked alignments are viewed in Jalview or as sequence logos. The database search uses the suffix array neighborhood search (SANS) method, which has been re-implemented as a client-server, improved and parallelized. The method is extremely fast and as sensitive as BLAST above 50% sequence identity. Benchmarks show that the method is highly competitive compared to previously published fast database search programs: UBLAST, DIAMOND, LAST, LAMBDA, RAPSEARCH2 and BLAT. The web server can be accessed interactively or programmatically at http://ekhidna2.biocenter.helsinki.fi/cgi-bin/sans/sans.cgi. It can be used to make protein functional annotation pipelines more efficient, and it is useful in interactive exploration of the detailed evidence supporting the annotation of particular proteins of interest. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Accelerating Smith-Waterman Alignment for Protein Database Search Using Frequency Distance Filtration Scheme Based on CPU-GPU Collaborative System.

PubMed

Liu, Yu; Hong, Yang; Lin, Chun-Yuan; Hung, Che-Lun

2015-01-01

The Smith-Waterman (SW) algorithm has been widely utilized for searching biological sequence databases in bioinformatics. Recently, several works have adopted the graphic card with Graphic Processing Units (GPUs) and their associated CUDA model to enhance the performance of SW computations. However, these works mainly focused on the protein database search by using the intertask parallelization technique, and only using the GPU capability to do the SW computations one by one. Hence, in this paper, we will propose an efficient SW alignment method, called CUDA-SWfr, for the protein database search by using the intratask parallelization technique based on a CPU-GPU collaborative system. Before doing the SW computations on GPU, a procedure is applied on CPU by using the frequency distance filtration scheme (FDFS) to eliminate the unnecessary alignments. The experimental results indicate that CUDA-SWfr runs 9.6 times and 96 times faster than the CPU-based SW method without and with FDFS, respectively.

Assignment of protein sequences to existing domain and family classification systems: Pfam and the PDB

PubMed Central

Dunbrack, Roland L.

2012-01-01

Motivation: Automating the assignment of existing domain and protein family classifications to new sets of sequences is an important task. Current methods often miss assignments because remote relationships fail to achieve statistical significance. Some assignments are not as long as the actual domain definitions because local alignment methods often cut alignments short. Long insertions in query sequences often erroneously result in two copies of the domain assigned to the query. Divergent repeat sequences in proteins are often missed. Results: We have developed a multilevel procedure to produce nearly complete assignments of protein families of an existing classification system to a large set of sequences. We apply this to the task of assigning Pfam domains to sequences and structures in the Protein Data Bank (PDB). We found that HHsearch alignments frequently scored more remotely related Pfams in Pfam clans higher than closely related Pfams, thus, leading to erroneous assignment at the Pfam family level. A greedy algorithm allowing for partial overlaps was, thus, applied first to sequence/HMM alignments, then HMM–HMM alignments and then structure alignments, taking care to join partial alignments split by large insertions into single-domain assignments. Additional assignment of repeat Pfams with weaker E-values was allowed after stronger assignments of the repeat HMM. Our database of assignments, presented in a database called PDBfam, contains Pfams for 99.4% of chains >50 residues. Availability: The Pfam assignment data in PDBfam are available at http://dunbrack2.fccc.edu/ProtCid/PDBfam, which can be searched by PDB codes and Pfam identifiers. They will be updated regularly. Contact: Roland.Dunbracks@fccc.edu PMID:22942020

A High-Throughput Arabidopsis Reverse Genetics System

PubMed Central

Sessions, Allen; Burke, Ellen; Presting, Gernot; Aux, George; McElver, John; Patton, David; Dietrich, Bob; Ho, Patrick; Bacwaden, Johana; Ko, Cynthia; Clarke, Joseph D.; Cotton, David; Bullis, David; Snell, Jennifer; Miguel, Trini; Hutchison, Don; Kimmerly, Bill; Mitzel, Theresa; Katagiri, Fumiaki; Glazebrook, Jane; Law, Marc; Goff, Stephen A.

2002-01-01

A collection of Arabidopsis lines with T-DNA insertions in known sites was generated to increase the efficiency of functional genomics. A high-throughput modified thermal asymetric interlaced (TAIL)-PCR protocol was developed and used to amplify DNA fragments flanking the T-DNA left borders from ∼100,000 transformed lines. A total of 85,108 TAIL-PCR products from 52,964 T-DNA lines were sequenced and compared with the Arabidopsis genome to determine the positions of T-DNAs in each line. Predicted T-DNA insertion sites, when mapped, showed a bias against predicted coding sequences. Predicted insertion mutations in genes of interest can be identified using Arabidopsis Gene Index name searches or by BLAST (Basic Local Alignment Search Tool) search. Insertions can be confirmed by simple PCR assays on individual lines. Predicted insertions were confirmed in 257 of 340 lines tested (76%). This resource has been named SAIL (Syngenta Arabidopsis Insertion Library) and is available to the scientific community at www.tmri.org. PMID:12468722

HBLAST: Parallelised sequence similarity--A Hadoop MapReducable basic local alignment search tool.

PubMed

O'Driscoll, Aisling; Belogrudov, Vladislav; Carroll, John; Kropp, Kai; Walsh, Paul; Ghazal, Peter; Sleator, Roy D

2015-04-01

The recent exponential growth of genomic databases has resulted in the common task of sequence alignment becoming one of the major bottlenecks in the field of computational biology. It is typical for these large datasets and complex computations to require cost prohibitive High Performance Computing (HPC) to function. As such, parallelised solutions have been proposed but many exhibit scalability limitations and are incapable of effectively processing "Big Data" - the name attributed to datasets that are extremely large, complex and require rapid processing. The Hadoop framework, comprised of distributed storage and a parallelised programming framework known as MapReduce, is specifically designed to work with such datasets but it is not trivial to efficiently redesign and implement bioinformatics algorithms according to this paradigm. The parallelisation strategy of "divide and conquer" for alignment algorithms can be applied to both data sets and input query sequences. However, scalability is still an issue due to memory constraints or large databases, with very large database segmentation leading to additional performance decline. Herein, we present Hadoop Blast (HBlast), a parallelised BLAST algorithm that proposes a flexible method to partition both databases and input query sequences using "virtual partitioning". HBlast presents improved scalability over existing solutions and well balanced computational work load while keeping database segmentation and recompilation to a minimum. Enhanced BLAST search performance on cheap memory constrained hardware has significant implications for in field clinical diagnostic testing; enabling faster and more accurate identification of pathogenic DNA in human blood or tissue samples. Copyright © 2015 Elsevier Inc. All rights reserved.

Adaptive Local Realignment of Protein Sequences.

PubMed

DeBlasio, Dan; Kececioglu, John

2018-06-11

While mutation rates can vary markedly over the residues of a protein, multiple sequence alignment tools typically use the same values for their scoring-function parameters across a protein's entire length. We present a new approach, called adaptive local realignment, that in contrast automatically adapts to the diversity of mutation rates along protein sequences. This builds upon a recent technique known as parameter advising, which finds global parameter settings for an aligner, to now adaptively find local settings. Our approach in essence identifies local regions with low estimated accuracy, constructs a set of candidate realignments using a carefully-chosen collection of parameter settings, and replaces the region if a realignment has higher estimated accuracy. This new method of local parameter advising, when combined with prior methods for global advising, boosts alignment accuracy as much as 26% over the best default setting on hard-to-align protein benchmarks, and by 6.4% over global advising alone. Adaptive local realignment has been implemented within the Opal aligner using the Facet accuracy estimator.

How effective are DNA barcodes in the identification of African rainforest trees?

PubMed

Parmentier, Ingrid; Duminil, Jérôme; Kuzmina, Maria; Philippe, Morgane; Thomas, Duncan W; Kenfack, David; Chuyong, George B; Cruaud, Corinne; Hardy, Olivier J

2013-01-01

DNA barcoding of rain forest trees could potentially help biologists identify species and discover new ones. However, DNA barcodes cannot always distinguish between closely related species, and the size and completeness of barcode databases are key parameters for their successful application. We test the ability of rbcL, matK and trnH-psbA plastid DNA markers to identify rain forest trees at two sites in Atlantic central Africa under the assumption that a database is exhaustive in terms of species content, but not necessarily in terms of haplotype diversity within species. We assess the accuracy of identification to species or genus using a genetic distance matrix between samples either based on a global multiple sequence alignment (GD) or on a basic local alignment search tool (BLAST). Where a local database is available (within a 50 ha plot), barcoding was generally reliable for genus identification (95-100% success), but less for species identification (71-88%). Using a single marker, best results for species identification were obtained with trnH-psbA. There was a significant decrease of barcoding success in species-rich clades. When the local database was used to identify the genus of trees from another region and did include all genera from the query individuals but not all species, genus identification success decreased to 84-90%. The GD method performed best but a global multiple sequence alignment is not applicable on trnH-psbA. Barcoding is a useful tool to assign unidentified African rain forest trees to a genus, but identification to a species is less reliable, especially in species-rich clades, even using an exhaustive local database. Combining two markers improves the accuracy of species identification but it would only marginally improve genus identification. Finally, we highlight some limitations of the BLAST algorithm as currently implemented and suggest possible improvements for barcoding applications.

How Effective Are DNA Barcodes in the Identification of African Rainforest Trees?

PubMed Central

Parmentier, Ingrid; Duminil, Jérôme; Kuzmina, Maria; Philippe, Morgane; Thomas, Duncan W.; Kenfack, David; Chuyong, George B.; Cruaud, Corinne; Hardy, Olivier J.

2013-01-01

Background DNA barcoding of rain forest trees could potentially help biologists identify species and discover new ones. However, DNA barcodes cannot always distinguish between closely related species, and the size and completeness of barcode databases are key parameters for their successful application. We test the ability of rbcL, matK and trnH-psbA plastid DNA markers to identify rain forest trees at two sites in Atlantic central Africa under the assumption that a database is exhaustive in terms of species content, but not necessarily in terms of haplotype diversity within species. Methodology/Principal Findings We assess the accuracy of identification to species or genus using a genetic distance matrix between samples either based on a global multiple sequence alignment (GD) or on a basic local alignment search tool (BLAST). Where a local database is available (within a 50 ha plot), barcoding was generally reliable for genus identification (95–100% success), but less for species identification (71–88%). Using a single marker, best results for species identification were obtained with trnH-psbA. There was a significant decrease of barcoding success in species-rich clades. When the local database was used to identify the genus of trees from another region and did include all genera from the query individuals but not all species, genus identification success decreased to 84–90%. The GD method performed best but a global multiple sequence alignment is not applicable on trnH-psbA. Conclusions/Significance Barcoding is a useful tool to assign unidentified African rain forest trees to a genus, but identification to a species is less reliable, especially in species-rich clades, even using an exhaustive local database. Combining two markers improves the accuracy of species identification but it would only marginally improve genus identification. Finally, we highlight some limitations of the BLAST algorithm as currently implemented and suggest possible improvements for barcoding applications. PMID:23565134

PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results.

PubMed

He, Ji; Dai, Xinbin; Zhao, Xuechun

2007-02-09

BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating unknown sequences, investigating gene models and comparing two sequence sets. Advances in sequencing technologies pose challenges for high-throughput analysis of large-scale sequence data. A number of programs and hardware solutions exist for efficient BLAST searching, but there is a lack of generic software solutions for mining and personalized management of the results. Systematically reviewing the results and identifying information of interest remains tedious and time-consuming. Personal BLAST Navigator (PLAN) is a versatile web platform that helps users to carry out various personalized pre- and post-BLAST tasks, including: (1) query and target sequence database management, (2) automated high-throughput BLAST searching, (3) indexing and searching of results, (4) filtering results online, (5) managing results of personal interest in favorite categories, (6) automated sequence annotation (such as NCBI NR and ontology-based annotation). PLAN integrates, by default, the Decypher hardware-based BLAST solution provided by Active Motif Inc. with a greatly improved efficiency over conventional BLAST software. BLAST results are visualized by spreadsheets and graphs and are full-text searchable. BLAST results and sequence annotations can be exported, in part or in full, in various formats including Microsoft Excel and FASTA. Sequences and BLAST results are organized in projects, the data publication levels of which are controlled by the registered project owners. In addition, all analytical functions are provided to public users without registration. PLAN has proved a valuable addition to the community for automated high-throughput BLAST searches, and, more importantly, for knowledge discovery, management and sharing based on sequence alignment results. The PLAN web interface is platform-independent, easily configurable and capable of comprehensive expansion, and user-intuitive. PLAN is freely available to academic users at http://bioinfo.noble.org/plan/. The source code for local deployment is provided under free license. Full support on system utilization, installation, configuration and customization are provided to academic users.

PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results

PubMed Central

He, Ji; Dai, Xinbin; Zhao, Xuechun

2007-01-01

Background BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating unknown sequences, investigating gene models and comparing two sequence sets. Advances in sequencing technologies pose challenges for high-throughput analysis of large-scale sequence data. A number of programs and hardware solutions exist for efficient BLAST searching, but there is a lack of generic software solutions for mining and personalized management of the results. Systematically reviewing the results and identifying information of interest remains tedious and time-consuming. Results Personal BLAST Navigator (PLAN) is a versatile web platform that helps users to carry out various personalized pre- and post-BLAST tasks, including: (1) query and target sequence database management, (2) automated high-throughput BLAST searching, (3) indexing and searching of results, (4) filtering results online, (5) managing results of personal interest in favorite categories, (6) automated sequence annotation (such as NCBI NR and ontology-based annotation). PLAN integrates, by default, the Decypher hardware-based BLAST solution provided by Active Motif Inc. with a greatly improved efficiency over conventional BLAST software. BLAST results are visualized by spreadsheets and graphs and are full-text searchable. BLAST results and sequence annotations can be exported, in part or in full, in various formats including Microsoft Excel and FASTA. Sequences and BLAST results are organized in projects, the data publication levels of which are controlled by the registered project owners. In addition, all analytical functions are provided to public users without registration. Conclusion PLAN has proved a valuable addition to the community for automated high-throughput BLAST searches, and, more importantly, for knowledge discovery, management and sharing based on sequence alignment results. The PLAN web interface is platform-independent, easily configurable and capable of comprehensive expansion, and user-intuitive. PLAN is freely available to academic users at . The source code for local deployment is provided under free license. Full support on system utilization, installation, configuration and customization are provided to academic users. PMID:17291345

Collinear masking effect in visual search is independent of perceptual salience.

PubMed

Jingling, Li; Lu, Yi-Hui; Cheng, Miao; Tseng, Chia-Huei

2017-07-01

Searching for a target in a salient region should be easier than looking for one in a nonsalient region. However, we previously discovered a contradictory phenomenon in which a local target in a salient structure was more difficult to find than one in the background. The salient structure was constructed of orientation singletons aligned to each other to form a collinear structure. In the present study, we undertake to determine whether such a masking effect was a result of salience competition between a global structure and the local target. In the first 3 experiments, we increased the salience value of the local target with the hope of adding to its competitive advantage and eventually eliminating the masking effect; nevertheless, the masking effect persisted. In an additional 2 experiments, we reduced salience of the global collinear structure by altering the orientation of the background bars and the masking effect still emerged. Our salience manipulations were validated by a controlled condition in which the global structure was grouped noncollinearly. In this case, local target salience increase (e.g., onset) or global distractor salience reduction (e.g., randomized flanking orientations) effectively removed the facilitation effect of the noncollinear structure. Our data suggest that salience competition is unlikely to explain the collinear masking effect, and other mechanisms such as contour integration, border formation, or the crowding effect may be prospective candidates for further investigation.

Windows .NET Network Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST)

PubMed Central

Dowd, Scot E; Zaragoza, Joaquin; Rodriguez, Javier R; Oliver, Melvin J; Payton, Paxton R

2005-01-01

Background BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST), which enhances the BLAST utility by improving usability, fault recovery, and scalability in a Windows desktop environment. Our goal was to develop an easy to use, fault tolerant, high-throughput BLAST solution that incorporates a comprehensive BLAST result viewer with curation and annotation functionality. Results W.ND-BLAST is a comprehensive Windows-based software toolkit that targets researchers, including those with minimal computer skills, and provides the ability increase the performance of BLAST by distributing BLAST queries to any number of Windows based machines across local area networks (LAN). W.ND-BLAST provides intuitive Graphic User Interfaces (GUI) for BLAST database creation, BLAST execution, BLAST output evaluation and BLAST result exportation. This software also provides several layers of fault tolerance and fault recovery to prevent loss of data if nodes or master machines fail. This paper lays out the functionality of W.ND-BLAST. W.ND-BLAST displays close to 100% performance efficiency when distributing tasks to 12 remote computers of the same performance class. A high throughput BLAST job which took 662.68 minutes (11 hours) on one average machine was completed in 44.97 minutes when distributed to 17 nodes, which included lower performance class machines. Finally, there is a comprehensive high-throughput BLAST Output Viewer (BOV) and Annotation Engine components, which provides comprehensive exportation of BLAST hits to text files, annotated fasta files, tables, or association files. Conclusion W.ND-BLAST provides an interactive tool that allows scientists to easily utilizing their available computing resources for high throughput and comprehensive sequence analyses. The install package for W.ND-BLAST is freely downloadable from . With registration the software is free, installation, networking, and usage instructions are provided as well as a support forum. PMID:15819992

Protein Identification Using Top-Down Spectra*

PubMed Central

Liu, Xiaowen; Sirotkin, Yakov; Shen, Yufeng; Anderson, Gordon; Tsai, Yihsuan S.; Ting, Ying S.; Goodlett, David R.; Smith, Richard D.; Bafna, Vineet; Pevzner, Pavel A.

2012-01-01

In the last two years, because of advances in protein separation and mass spectrometry, top-down mass spectrometry moved from analyzing single proteins to analyzing complex samples and identifying hundreds and even thousands of proteins. However, computational tools for database search of top-down spectra against protein databases are still in their infancy. We describe MS-Align+, a fast algorithm for top-down protein identification based on spectral alignment that enables searches for unexpected post-translational modifications. We also propose a method for evaluating statistical significance of top-down protein identifications and further benchmark various software tools on two top-down data sets from Saccharomyces cerevisiae and Salmonella typhimurium. We demonstrate that MS-Align+ significantly increases the number of identified spectra as compared with MASCOT and OMSSA on both data sets. Although MS-Align+ and ProSightPC have similar performance on the Salmonella typhimurium data set, MS-Align+ outperforms ProSightPC on the (more complex) Saccharomyces cerevisiae data set. PMID:22027200

PMD2HD--a web tool aligning a PubMed search results page with the local German Cancer Research Centre library collection.

PubMed

Bohne-Lang, Andreas; Lang, Elke; Taube, Anke

2005-06-27

Web-based searching is the accepted contemporary mode of retrieving relevant literature, and retrieving as many full text articles as possible is a typical prerequisite for research success. In most cases only a proportion of references will be directly accessible as digital reprints through displayed links. A large number of references, however, have to be verified in library catalogues and, depending on their availability, are accessible as print holdings or by interlibrary loan request. The problem of verifying local print holdings from an initial retrieval set of citations can be solved using Z39.50, an ANSI protocol for interactively querying library information systems. Numerous systems include Z39.50 interfaces and therefore can process Z39.50 interactive requests. However, the programmed query interaction command structure is non-intuitive and inaccessible to the average biomedical researcher. For the typical user, it is necessary to implement the protocol within a tool that hides and handles Z39.50 syntax, presenting a comfortable user interface. PMD2HD is a web tool implementing Z39.50 to provide an appropriately functional and usable interface to integrate into the typical workflow that follows an initial PubMed literature search, providing users with an immediate asset to assist in the most tedious step in literature retrieval, checking for subscription holdings against a local online catalogue. PMD2HD can facilitate literature access considerably with respect to the time and cost of manual comparisons of search results with local catalogue holdings. The example presented in this article is related to the library system and collections of the German Cancer Research Centre. However, the PMD2HD software architecture and use of common Z39.50 protocol commands allow for transfer to a broad range of scientific libraries using Z39.50-compatible library information systems.

Cloud4Psi: cloud computing for 3D protein structure similarity searching.

PubMed

Mrozek, Dariusz; Małysiak-Mrozek, Bożena; Kłapciński, Artur

2014-10-01

Popular methods for 3D protein structure similarity searching, especially those that generate high-quality alignments such as Combinatorial Extension (CE) and Flexible structure Alignment by Chaining Aligned fragment pairs allowing Twists (FATCAT) are still time consuming. As a consequence, performing similarity searching against large repositories of structural data requires increased computational resources that are not always available. Cloud computing provides huge amounts of computational power that can be provisioned on a pay-as-you-go basis. We have developed the cloud-based system that allows scaling of the similarity searching process vertically and horizontally. Cloud4Psi (Cloud for Protein Similarity) was tested in the Microsoft Azure cloud environment and provided good, almost linearly proportional acceleration when scaled out onto many computational units. Cloud4Psi is available as Software as a Service for testing purposes at: http://cloud4psi.cloudapp.net/. For source code and software availability, please visit the Cloud4Psi project home page at http://zti.polsl.pl/dmrozek/science/cloud4psi.htm. © The Author 2014. Published by Oxford University Press.

Cloud4Psi: cloud computing for 3D protein structure similarity searching

PubMed Central

Mrozek, Dariusz; Małysiak-Mrozek, Bożena; Kłapciński, Artur

2014-01-01

Summary: Popular methods for 3D protein structure similarity searching, especially those that generate high-quality alignments such as Combinatorial Extension (CE) and Flexible structure Alignment by Chaining Aligned fragment pairs allowing Twists (FATCAT) are still time consuming. As a consequence, performing similarity searching against large repositories of structural data requires increased computational resources that are not always available. Cloud computing provides huge amounts of computational power that can be provisioned on a pay-as-you-go basis. We have developed the cloud-based system that allows scaling of the similarity searching process vertically and horizontally. Cloud4Psi (Cloud for Protein Similarity) was tested in the Microsoft Azure cloud environment and provided good, almost linearly proportional acceleration when scaled out onto many computational units. Availability and implementation: Cloud4Psi is available as Software as a Service for testing purposes at: http://cloud4psi.cloudapp.net/. For source code and software availability, please visit the Cloud4Psi project home page at http://zti.polsl.pl/dmrozek/science/cloud4psi.htm. Contact: dariusz.mrozek@polsl.pl PMID:24930141

GenoMycDB: a database for comparative analysis of mycobacterial genes and genomes.

PubMed

Catanho, Marcos; Mascarenhas, Daniel; Degrave, Wim; Miranda, Antonio Basílio de

2006-03-31

Several databases and computational tools have been created with the aim of organizing, integrating and analyzing the wealth of information generated by large-scale sequencing projects of mycobacterial genomes and those of other organisms. However, with very few exceptions, these databases and tools do not allow for massive and/or dynamic comparison of these data. GenoMycDB (http://www.dbbm.fiocruz.br/GenoMycDB) is a relational database built for large-scale comparative analyses of completely sequenced mycobacterial genomes, based on their predicted protein content. Its central structure is composed of the results obtained after pair-wise sequence alignments among all the predicted proteins coded by the genomes of six mycobacteria: Mycobacterium tuberculosis (strains H37Rv and CDC1551), M. bovis AF2122/97, M. avium subsp. paratuberculosis K10, M. leprae TN, and M. smegmatis MC2 155. The database stores the computed similarity parameters of every aligned pair, providing for each protein sequence the predicted subcellular localization, the assigned cluster of orthologous groups, the features of the corresponding gene, and links to several important databases. Tables containing pairs or groups of potential homologs between selected species/strains can be produced dynamically by user-defined criteria, based on one or multiple sequence similarity parameters. In addition, searches can be restricted according to the predicted subcellular localization of the protein, the DNA strand of the corresponding gene and/or the description of the protein. Massive data search and/or retrieval are available, and different ways of exporting the result are offered. GenoMycDB provides an on-line resource for the functional classification of mycobacterial proteins as well as for the analysis of genome structure, organization, and evolution.

160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)

PubMed Central

Li, Isaac TS; Shum, Warren; Truong, Kevin

2007-01-01

Background To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching sequence databases that may contain hundreds of millions of sequences, this algorithm becomes computationally expensive. Results In this paper, we focused on accelerating the Smith-Waterman algorithm by using FPGA-based hardware that implemented a module for computing the score of a single cell of the SW matrix. Then using a grid of this module, the entire SW matrix was computed at the speed of field propagation through the FPGA circuit. These modifications dramatically accelerated the algorithm's computation time by up to 160 folds compared to a pure software implementation running on the same FPGA with an Altera Nios II softprocessor. Conclusion This design of FPGA accelerated hardware offers a new promising direction to seeking computation improvement of genomic database searching. PMID:17555593

160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA).

PubMed

Li, Isaac T S; Shum, Warren; Truong, Kevin

2007-06-07

To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching sequence databases that may contain hundreds of millions of sequences, this algorithm becomes computationally expensive. In this paper, we focused on accelerating the Smith-Waterman algorithm by using FPGA-based hardware that implemented a module for computing the score of a single cell of the SW matrix. Then using a grid of this module, the entire SW matrix was computed at the speed of field propagation through the FPGA circuit. These modifications dramatically accelerated the algorithm's computation time by up to 160 folds compared to a pure software implementation running on the same FPGA with an Altera Nios II softprocessor. This design of FPGA accelerated hardware offers a new promising direction to seeking computation improvement of genomic database searching.

Score distributions of gapped multiple sequence alignments down to the low-probability tail

NASA Astrophysics Data System (ADS)

Fieth, Pascal; Hartmann, Alexander K.

2016-08-01

Assessing the significance of alignment scores of optimally aligned DNA or amino acid sequences can be achieved via the knowledge of the score distribution of random sequences. But this requires obtaining the distribution in the biologically relevant high-scoring region, where the probabilities are exponentially small. For gapless local alignments of infinitely long sequences this distribution is known analytically to follow a Gumbel distribution. Distributions for gapped local alignments and global alignments of finite lengths can only be obtained numerically. To obtain result for the small-probability region, specific statistical mechanics-based rare-event algorithms can be applied. In previous studies, this was achieved for pairwise alignments. They showed that, contrary to results from previous simple sampling studies, strong deviations from the Gumbel distribution occur in case of finite sequence lengths. Here we extend the studies to multiple sequence alignments with gaps, which are much more relevant for practical applications in molecular biology. We study the distributions of scores over a large range of the support, reaching probabilities as small as 10-160, for global and local (sum-of-pair scores) multiple alignments. We find that even after suitable rescaling, eliminating the sequence-length dependence, the distributions for multiple alignment differ from the pairwise alignment case. Furthermore, we also show that the previously discussed Gaussian correction to the Gumbel distribution needs to be refined, also for the case of pairwise alignments.

Local alignment vectors reveal cancer cell-induced ECM fiber remodeling dynamics

PubMed Central

Lee, Byoungkoo; Konen, Jessica; Wilkinson, Scott; Marcus, Adam I.; Jiang, Yi

2017-01-01

Invasive cancer cells interact with the surrounding extracellular matrix (ECM), remodeling ECM fiber network structure by condensing, degrading, and aligning these fibers. We developed a novel local alignment vector analysis method to quantitatively measure collagen fiber alignment as a vector field using Circular Statistics. This method was applied to human non-small cell lung carcinoma (NSCLC) cell lines, embedded as spheroids in a collagen gel. Collagen remodeling was monitored using second harmonic generation imaging under normal conditions and when the LKB1-MARK1 pathway was disrupted through RNAi-based approaches. The results showed that inhibiting LKB1 or MARK1 in NSCLC increases the collagen fiber alignment and captures outward alignment vectors from the tumor spheroid, corresponding to high invasiveness of LKB1 mutant cancer cells. With time-lapse imaging of ECM micro-fiber morphology, the local alignment vector can measure the dynamic signature of invasive cancer cell activity and cell-migration-induced ECM and collagen remodeling and realigning dynamics. PMID:28045069

Data on partial polyhydroxyalkanoate synthase genes (phaC) mined from Aaptos aaptos marine sponge-associated bacteria metagenome.

PubMed

Amelia, Tan Suet May; Amirul, Al-Ashraf Abdullah; Bhubalan, Kesaven

2018-02-01

We report data associated with the identification of three polyhydroxyalkanoate synthase genes (phaC) isolated from the marine bacteria metagenome of Aaptos aaptos marine sponge in the waters of Bidong Island, Terengganu, Malaysia. Our data describe the extraction of bacterial metagenome from sponge tissue, measurement of purity and concentration of extracted metagenome, polymerase chain reaction (PCR)-mediated amplification using degenerate primers targeting Class I and II phaC genes, sequencing at First BASE Laboratories Sdn Bhd, and phylogenetic analysis of identified and known phaC genes. The partial nucleotide sequences were aligned, refined, compared with the Basic Local Alignment Search Tool (BLAST) databases, and released online in GenBank. The data include the identified partial putative phaC and their GenBank accession numbers, which are Rhodocista sp. phaC (MF457754), Pseudomonas sp. phaC (MF437016), and an uncultured bacterium AR5-9d_16 phaC (MF457753).

Biogeographic patterns in ocean microbes emerge in a neutral agent-based model.

PubMed

Hellweger, Ferdi L; van Sebille, Erik; Fredrick, Neil D

2014-09-12

A key question in ecology and evolution is the relative role of natural selection and neutral evolution in producing biogeographic patterns. We quantify the role of neutral processes by simulating division, mutation, and death of 100,000 individual marine bacteria cells with full 1 million-base-pair genomes in a global surface ocean circulation model. The model is run for up to 100,000 years and output is analyzed using BLAST (Basic Local Alignment Search Tool) alignment and metagenomics fragment recruitment. Simulations show the production and maintenance of biogeographic patterns, characterized by distinct provinces subject to mixing and periodic takeovers by neighbors (coalescence), after which neutral evolution reestablishes the province and the patterns reorganize. The emergent patterns are substantial (e.g., down to 99.5% DNA identity between North and Central Pacific provinces) and suggest that microbes evolve faster than ocean currents can disperse them. This approach can also be used to explore environmental selection. Copyright © 2014, American Association for the Advancement of Science.

Alignments of the galaxies in and around the Virgo cluster with the local velocity shear

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Jounghun; Rey, Soo Chang; Kim, Suk, E-mail: jounghun@astro.snu.ac.kr

2014-08-10

Observational evidence is presented for the alignment between the cosmic sheet and the principal axis of the velocity shear field at the position of the Virgo cluster. The galaxies in and around the Virgo cluster from the Extended Virgo Cluster Catalog that was recently constructed by Kim et al. are used to determine the direction of the local sheet. The peculiar velocity field reconstructed from the Sloan Digital Sky Survey Data Release 7 is analyzed to estimate the local velocity shear tensor at the Virgo center. Showing first that the minor principal axis of the local velocity shear tensor ismore » almost parallel to the direction of the line of sight, we detect a clear signal of alignment between the positions of the Virgo satellites and the intermediate principal axis of the local velocity shear projected onto the plane of the sky. Furthermore, the dwarf satellites are found to appear more strongly aligned than their normal counterparts, which is interpreted as an indication of the following. (1) The normal satellites and the dwarf satellites fall in the Virgo cluster preferentially along the local filament and the local sheet, respectively. (2) The local filament is aligned with the minor principal axis of the local velocity shear while the local sheet is parallel to the plane spanned by the minor and intermediate principal axes. Our result is consistent with the recent numerical claim that the velocity shear is a good tracer of the cosmic web.« less

Multiview alignment hashing for efficient image search.

PubMed

Liu, Li; Yu, Mengyang; Shao, Ling

2015-03-01

Hashing is a popular and efficient method for nearest neighbor search in large-scale data spaces by embedding high-dimensional feature descriptors into a similarity preserving Hamming space with a low dimension. For most hashing methods, the performance of retrieval heavily depends on the choice of the high-dimensional feature descriptor. Furthermore, a single type of feature cannot be descriptive enough for different images when it is used for hashing. Thus, how to combine multiple representations for learning effective hashing functions is an imminent task. In this paper, we present a novel unsupervised multiview alignment hashing approach based on regularized kernel nonnegative matrix factorization, which can find a compact representation uncovering the hidden semantics and simultaneously respecting the joint probability distribution of data. In particular, we aim to seek a matrix factorization to effectively fuse the multiple information sources meanwhile discarding the feature redundancy. Since the raised problem is regarded as nonconvex and discrete, our objective function is then optimized via an alternate way with relaxation and converges to a locally optimal solution. After finding the low-dimensional representation, the hashing functions are finally obtained through multivariable logistic regression. The proposed method is systematically evaluated on three data sets: 1) Caltech-256; 2) CIFAR-10; and 3) CIFAR-20, and the results show that our method significantly outperforms the state-of-the-art multiview hashing techniques.

Magnetic Field Strengths and Grain Alignment Variations in the Local Bubble Wall

NASA Astrophysics Data System (ADS)

Medan, Ilija; Andersson, B.-G.

2018-01-01

Optical and infrared continuum polarization is known to be due to irregular dust grains aligned with the magnetic field. This provides an important tool to probe the geometry and strength of those fields, particularly if the variations in the grain alignment efficiencies can be understood. Here, we examine polarization variations observed throughout the Local Bubble for b>30○, using a large polarization survey of the North Galactic cap from Berdyugin et al. (2014). These data are supported by archival photometric and spectroscopic data along with the mapping of the Local Bubble by Lallement et al. (2003). We can accurately model the observational data assuming that the grain alignment variations are due to the radiation from the OB associations within 1 kpc of the sun. This strongly supports radiatively driven grain alignment. We also probe the relative strength of the magnetic field in the wall of the Local Bubble using the Davis-Chandrasekhar-Fermi method. We find evidence for a bimodal field strength distribution, where the variations in the field are correlated with the variations in grain alignment efficiency, indicating that the higher strength regions might represent a compression of the wall by the interaction of the outflow in the Local Bubble and the opposing flows by the surrounding OB associations.

First report of Euryhelmis parasites (Trematoda, Heterophyidae) in Africa: conservation implications for endemic amphibians.

PubMed

Díaz-Rodríguez, Jesus; Donaire-Barroso, David; Jowers, Michael J

2018-06-02

In this study, we report, through molecular identification, the first African records of a digenean trematode parasite of the genus Euryhelmis. We recovered metacercariae encysted in an anuran, the endemic Moroccan painted frog (Discoglossus scovazzi), and a vulnerable caudate, the North African fire salamander (Salamandra algira), from four localities in North Africa (Morocco). Our records go back to the past century and have been confirmed in successive fieldwork seasons thereafter. Metacercarial stages of these parasites require amphibians as the last intermediate host, but the exact identity of the primary hosts and predators of the infected animals in Africa remain unknown. Our searches with basic local alignment search tool (BLAST) from Genbank revealed that hosts were infected by parasites of Euryhelmis costaricensis, which showed almost the same genetic identity (with only one substitution) to previous reports from Costa Rica and Japan, suggesting a recent introduction in Morocco. We proceed to discuss the likely role of introduced mustelids as the potential definitive hosts of trematode adults. Under this assumption, we conclude that the infestation of Discoglossus scovazzi and Salamandra algira might pose a risk to these threatened species.

Tree decomposition based fast search of RNA structures including pseudoknots in genomes.

PubMed

Song, Yinglei; Liu, Chunmei; Malmberg, Russell; Pan, Fangfang; Cai, Liming

2005-01-01

Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of efficient algorithms for accurate RNA structure-sequence alignment, computer programs capable of fast and effectively searching genomes for RNA secondary structures have not been available. In this paper, a novel RNA structure profiling model is introduced based on the notion of a conformational graph to specify the consensus structure of an RNA family. Tree decomposition yields a small tree width t for such conformation graphs (e.g., t = 2 for stem loops and only a slight increase for pseudo-knots). Within this modelling framework, the optimal alignment of a sequence to the structure model corresponds to finding a maximum valued isomorphic subgraph and consequently can be accomplished through dynamic programming on the tree decomposition of the conformational graph in time O(k(t)N(2)), where k is a small parameter; and N is the size of the projiled RNA structure. Experiments show that the application of the alignment algorithm to search in genomes yields the same search accuracy as methods based on a Covariance model with a significant reduction in computation time. In particular; very accurate searches of tmRNAs in bacteria genomes and of telomerase RNAs in yeast genomes can be accomplished in days, as opposed to months required by other methods. The tree decomposition based searching tool is free upon request and can be downloaded at our site h t t p ://w.uga.edu/RNA-informatics/software/index.php.

A Novel Partial Sequence Alignment Tool for Finding Large Deletions

PubMed Central

Aruk, Taner; Ustek, Duran; Kursun, Olcay

2012-01-01

Finding large deletions in genome sequences has become increasingly more useful in bioinformatics, such as in clinical research and diagnosis. Although there are a number of publically available next generation sequencing mapping and sequence alignment programs, these software packages do not correctly align fragments containing deletions larger than one kb. We present a fast alignment software package, BinaryPartialAlign, that can be used by wet lab scientists to find long structural variations in their experiments. For BinaryPartialAlign, we make use of the Smith-Waterman (SW) algorithm with a binary-search-based approach for alignment with large gaps that we called partial alignment. BinaryPartialAlign implementation is compared with other straight-forward applications of SW. Simulation results on mtDNA fragments demonstrate the effectiveness (runtime and accuracy) of the proposed method. PMID:22566777

Automatic bone segmentation in knee MR images using a coarse-to-fine strategy

NASA Astrophysics Data System (ADS)

Park, Sang Hyun; Lee, Soochahn; Yun, Il Dong; Lee, Sang Uk

2012-02-01

Segmentation of bone and cartilage from a three dimensional knee magnetic resonance (MR) image is a crucial element in monitoring and understanding of development and progress of osteoarthritis. Until now, various segmentation methods have been proposed to separate the bone from other tissues, but it still remains challenging problem due to different modality of MR images, low contrast between bone and tissues, and shape irregularity. In this paper, we present a new fully-automatic segmentation method of bone compartments using relevant bone atlases from a training set. To find the relevant bone atlases and obtain the segmentation, a coarse-to-fine strategy is proposed. In the coarse step, the best atlas among the training set and an initial segmentation are simultaneously detected using branch and bound tree search. Since the best atlas in the coarse step is not accurately aligned, all atlases from the training set are aligned to the initial segmentation, and the best aligned atlas is selected in the middle step. Finally, in the fine step, segmentation is conducted as adaptively integrating shape of the best aligned atlas and appearance prior based on characteristics of local regions. For experiment, femur and tibia bones of forty test MR images are segmented by the proposed method using sixty training MR images. Experimental results show that a performance of the segmentation and the registration becomes better as going near the fine step, and the proposed method obtain the comparable performance with the state-of-the-art methods.

Ligand Binding Site Detection by Local Structure Alignment and Its Performance Complementarity

PubMed Central

Lee, Hui Sun; Im, Wonpil

2013-01-01

Accurate determination of potential ligand binding sites (BS) is a key step for protein function characterization and structure-based drug design. Despite promising results of template-based BS prediction methods using global structure alignment (GSA), there is a room to improve the performance by properly incorporating local structure alignment (LSA) because BS are local structures and often similar for proteins with dissimilar global folds. We present a template-based ligand BS prediction method using G-LoSA, our LSA tool. A large benchmark set validation shows that G-LoSA predicts drug-like ligands’ positions in single-chain protein targets more precisely than TM-align, a GSA-based method, while the overall success rate of TM-align is better. G-LoSA is particularly efficient for accurate detection of local structures conserved across proteins with diverse global topologies. Recognizing the performance complementarity of G-LoSA to TM-align and a non-template geometry-based method, fpocket, a robust consensus scoring method, CMCS-BSP (Complementary Methods and Consensus Scoring for ligand Binding Site Prediction), is developed and shows improvement on prediction accuracy. The G-LoSA source code is freely available at http://im.bioinformatics.ku.edu/GLoSA. PMID:23957286

Identification and Analysis of Jasmonate Pathway Genes in Coffea canephora (Robusta Coffee) by In Silico Approach.

PubMed

Bharathi, Kosaraju; Sreenath, H L

2017-07-01

Coffea canephora is the commonly cultivated coffee species in the world along with Coffea arabica . Different pests and pathogens affect the production and quality of the coffee. Jasmonic acid (JA) is a plant hormone which plays an important role in plants growth, development, and defense mechanisms, particularly against insect pests. The key enzymes involved in the production of JA are lipoxygenase, allene oxide synthase, allene oxide cyclase, and 12-oxo-phytodienoic reductase. There is no report on the genes involved in JA pathway in coffee plants. We made an attempt to identify and analyze the genes coding for these enzymes in C. canephora . First, protein sequences of jasmonate pathway genes from model plant Arabidopsis thaliana were identified in the National Center for Biotechnology Information (NCBI) database. These protein sequences were used to search the web-based database Coffee Genome Hub to identify homologous protein sequences in C. canephora genome using Basic Local Alignment Search Tool (BLAST). Homologous protein sequences for key genes were identified in the C. canephora genome database. Protein sequences of the top matches were in turn used to search in NCBI database using BLAST tool to confirm the identity of the selected proteins and to identify closely related genes in species. The protein sequences from C. canephora database and the top matches in NCBI were aligned, and phylogenetic trees were constructed using MEGA6 software and identified the genetic distance of the respective genes. The study identified the four key genes of JA pathway in C. canephora , confirming the conserved nature of the pathway in coffee. The study expected to be useful to further explore the defense mechanisms of coffee plants. JA is a plant hormone that plays an important role in plant defense against insect pests. Genes coding for the 4 key enzymes involved in the production of JA viz., LOX, AOS, AOC, and OPR are identified in C. canephora (robusta coffee) by bioinformatic approaches confirming the conserved nature of the pathway in coffee. The findings are useful to understand the defense mechanisms of C. canephora and coffee breeding in the long run. JA is a plant hormone that plays an important role in plant defense against insect pests. Genes coding for the 4 key enzymes involved in the production of JA viz., LOX, AOS, AOC and OPR were identified and analyzed in C. canephora (robusta coffee) by in silico approach. The study has confirmed the conserved nature of JA pathway in coffee; the findings are useful to further explore the defense mechanisms of coffee plants. Abbreviations used: C. canephora : Coffea canephora ; C. arabica : Coffea arabica ; JA: Jasmonic acid; CGH: Coffee Genome Hub; NCBI: National Centre for Biotechnology Information; BLAST: Basic Local Alignment Search Tool; A. thaliana : Arabidopsis thaliana ; LOX: Lipoxygenase, AOS: Allene oxide synthase; AOC: Allene oxide cyclase; OPR: 12 oxo phytodienoic reductase.

Survey of local and global biological network alignment: the need to reconcile the two sides of the same coin.

PubMed

Guzzi, Pietro Hiram; Milenkovic, Tijana

2018-05-01

Analogous to genomic sequence alignment that allows for across-species transfer of biological knowledge between conserved sequence regions, biological network alignment can be used to guide the knowledge transfer between conserved regions of molecular networks of different species. Hence, biological network alignment can be used to redefine the traditional notion of a sequence-based homology to a new notion of network-based homology. Analogous to genomic sequence alignment, there exist local and global biological network alignments. Here, we survey prominent and recent computational approaches of each network alignment type and discuss their (dis)advantages. Then, as it was recently shown that the two approach types are complementary, in the sense that they capture different slices of cellular functioning, we discuss the need to reconcile the two network alignment types and present a recent first step in this direction. We conclude with some open research problems on this topic and comment on the usefulness of network alignment in other domains besides computational biology.

Desktop aligner for fabrication of multilayer microfluidic devices.

PubMed

Li, Xiang; Yu, Zeta Tak For; Geraldo, Dalton; Weng, Shinuo; Alve, Nitesh; Dun, Wu; Kini, Akshay; Patel, Karan; Shu, Roberto; Zhang, Feng; Li, Gang; Jin, Qinghui; Fu, Jianping

2015-07-01

Multilayer assembly is a commonly used technique to construct multilayer polydimethylsiloxane (PDMS)-based microfluidic devices with complex 3D architecture and connectivity for large-scale microfluidic integration. Accurate alignment of structure features on different PDMS layers before their permanent bonding is critical in determining the yield and quality of assembled multilayer microfluidic devices. Herein, we report a custom-built desktop aligner capable of both local and global alignments of PDMS layers covering a broad size range. Two digital microscopes were incorporated into the aligner design to allow accurate global alignment of PDMS structures up to 4 in. in diameter. Both local and global alignment accuracies of the desktop aligner were determined to be about 20 μm cm(-1). To demonstrate its utility for fabrication of integrated multilayer PDMS microfluidic devices, we applied the desktop aligner to achieve accurate alignment of different functional PDMS layers in multilayer microfluidics including an organs-on-chips device as well as a microfluidic device integrated with vertical passages connecting channels located in different PDMS layers. Owing to its convenient operation, high accuracy, low cost, light weight, and portability, the desktop aligner is useful for microfluidic researchers to achieve rapid and accurate alignment for generating multilayer PDMS microfluidic devices.

Desktop aligner for fabrication of multilayer microfluidic devices

PubMed Central

Li, Xiang; Yu, Zeta Tak For; Geraldo, Dalton; Weng, Shinuo; Alve, Nitesh; Dun, Wu; Kini, Akshay; Patel, Karan; Shu, Roberto; Zhang, Feng; Li, Gang; Jin, Qinghui; Fu, Jianping

2015-01-01

Multilayer assembly is a commonly used technique to construct multilayer polydimethylsiloxane (PDMS)-based microfluidic devices with complex 3D architecture and connectivity for large-scale microfluidic integration. Accurate alignment of structure features on different PDMS layers before their permanent bonding is critical in determining the yield and quality of assembled multilayer microfluidic devices. Herein, we report a custom-built desktop aligner capable of both local and global alignments of PDMS layers covering a broad size range. Two digital microscopes were incorporated into the aligner design to allow accurate global alignment of PDMS structures up to 4 in. in diameter. Both local and global alignment accuracies of the desktop aligner were determined to be about 20 μm cm−1. To demonstrate its utility for fabrication of integrated multilayer PDMS microfluidic devices, we applied the desktop aligner to achieve accurate alignment of different functional PDMS layers in multilayer microfluidics including an organs-on-chips device as well as a microfluidic device integrated with vertical passages connecting channels located in different PDMS layers. Owing to its convenient operation, high accuracy, low cost, light weight, and portability, the desktop aligner is useful for microfluidic researchers to achieve rapid and accurate alignment for generating multilayer PDMS microfluidic devices. PMID:26233409

AlignNemo: a local network alignment method to integrate homology and topology.

PubMed

Ciriello, Giovanni; Mina, Marco; Guzzi, Pietro H; Cannataro, Mario; Guerra, Concettina

2012-01-01

Local network alignment is an important component of the analysis of protein-protein interaction networks that may lead to the identification of evolutionary related complexes. We present AlignNemo, a new algorithm that, given the networks of two organisms, uncovers subnetworks of proteins that relate in biological function and topology of interactions. The discovered conserved subnetworks have a general topology and need not to correspond to specific interaction patterns, so that they more closely fit the models of functional complexes proposed in the literature. The algorithm is able to handle sparse interaction data with an expansion process that at each step explores the local topology of the networks beyond the proteins directly interacting with the current solution. To assess the performance of AlignNemo, we ran a series of benchmarks using statistical measures as well as biological knowledge. Based on reference datasets of protein complexes, AlignNemo shows better performance than other methods in terms of both precision and recall. We show our solutions to be biologically sound using the concept of semantic similarity applied to Gene Ontology vocabularies. The binaries of AlignNemo and supplementary details about the algorithms and the experiments are available at: sourceforge.net/p/alignnemo.

--No Title--

Science.gov Websites

-1242px}.vehicle_search_box{border:1px solid #ccc;background-color:#eee;padding:10px;height:312px }.vehicle_search_by_mfg_box{height:150px}.vehicle_detail_box{border:1px solid #ccc;background-color:#eee;padding:10px;height }.search_button{width:100%;text-align:right}h2{color:#45812E;line-height:24px}h3{margin:0;color:black}.search-btn

Self-synchronization for spread spectrum audio watermarks after time scale modification

NASA Astrophysics Data System (ADS)

Nadeau, Andrew; Sharma, Gaurav

2014-02-01

De-synchronizing operations such as insertion, deletion, and warping pose significant challenges for watermarking. Because these operations are not typical for classical communications, watermarking techniques such as spread spectrum can perform poorly. Conversely, specialized synchronization solutions can be challenging to analyze/ optimize. This paper addresses desynchronization for blind spread spectrum watermarks, detected without reference to any unmodified signal, using the robustness properties of short blocks. Synchronization relies on dynamic time warping to search over block alignments to find a sequence with maximum correlation to the watermark. This differs from synchronization schemes that must first locate invariant features of the original signal, or estimate and reverse desynchronization before detection. Without these extra synchronization steps, analysis for the proposed scheme builds on classical SS concepts and allows characterizes the relationship between the size of search space (number of detection alignment tests) and intrinsic robustness (continuous search space region covered by each individual detection test). The critical metrics that determine the search space, robustness, and performance are: time-frequency resolution of the watermarking transform, and blocklength resolution of the alignment. Simultaneous robustness to (a) MP3 compression, (b) insertion/deletion, and (c) time-scale modification is also demonstrated for a practical audio watermarking scheme developed in the proposed framework.

Theory of short-scale field-aligned density striations due to ionospheric heating

NASA Technical Reports Server (NTRS)

Lee, M.-C.; Fejer, J. A.

1978-01-01

The theoretical saturation spectrum of parametrically excited Langmuir waves in a locally uniform ionosphere is shown by the present calculations to produce, by ohmic dissipation, short-scale field-aligned density striations. The spectrum of the calculated striations is not inconsistent with observations of field-aligned scatter of VHF and UHF waves in ionospheric modification experiments if local increases of the pump field due to focusing are invoked.

Searching Remote Homology with Spectral Clustering with Symmetry in Neighborhood Cluster Kernels

PubMed Central

Maulik, Ujjwal; Sarkar, Anasua

2013-01-01

Remote homology detection among proteins utilizing only the unlabelled sequences is a central problem in comparative genomics. The existing cluster kernel methods based on neighborhoods and profiles and the Markov clustering algorithms are currently the most popular methods for protein family recognition. The deviation from random walks with inflation or dependency on hard threshold in similarity measure in those methods requires an enhancement for homology detection among multi-domain proteins. We propose to combine spectral clustering with neighborhood kernels in Markov similarity for enhancing sensitivity in detecting homology independent of “recent” paralogs. The spectral clustering approach with new combined local alignment kernels more effectively exploits the unsupervised protein sequences globally reducing inter-cluster walks. When combined with the corrections based on modified symmetry based proximity norm deemphasizing outliers, the technique proposed in this article outperforms other state-of-the-art cluster kernels among all twelve implemented kernels. The comparison with the state-of-the-art string and mismatch kernels also show the superior performance scores provided by the proposed kernels. Similar performance improvement also is found over an existing large dataset. Therefore the proposed spectral clustering framework over combined local alignment kernels with modified symmetry based correction achieves superior performance for unsupervised remote homolog detection even in multi-domain and promiscuous domain proteins from Genolevures database families with better biological relevance. Source code available upon request. Contact: sarkar@labri.fr. PMID:23457439

Searching remote homology with spectral clustering with symmetry in neighborhood cluster kernels.

PubMed

Maulik, Ujjwal; Sarkar, Anasua

2013-01-01

Remote homology detection among proteins utilizing only the unlabelled sequences is a central problem in comparative genomics. The existing cluster kernel methods based on neighborhoods and profiles and the Markov clustering algorithms are currently the most popular methods for protein family recognition. The deviation from random walks with inflation or dependency on hard threshold in similarity measure in those methods requires an enhancement for homology detection among multi-domain proteins. We propose to combine spectral clustering with neighborhood kernels in Markov similarity for enhancing sensitivity in detecting homology independent of "recent" paralogs. The spectral clustering approach with new combined local alignment kernels more effectively exploits the unsupervised protein sequences globally reducing inter-cluster walks. When combined with the corrections based on modified symmetry based proximity norm deemphasizing outliers, the technique proposed in this article outperforms other state-of-the-art cluster kernels among all twelve implemented kernels. The comparison with the state-of-the-art string and mismatch kernels also show the superior performance scores provided by the proposed kernels. Similar performance improvement also is found over an existing large dataset. Therefore the proposed spectral clustering framework over combined local alignment kernels with modified symmetry based correction achieves superior performance for unsupervised remote homolog detection even in multi-domain and promiscuous domain proteins from Genolevures database families with better biological relevance. Source code available upon request. sarkar@labri.fr.

COACH: profile-profile alignment of protein families using hidden Markov models.

PubMed

Edgar, Robert C; Sjölander, Kimmen

2004-05-22

Alignments of two multiple-sequence alignments, or statistical models of such alignments (profiles), have important applications in computational biology. The increased amount of information in a profile versus a single sequence can lead to more accurate alignments and more sensitive homolog detection in database searches. Several profile-profile alignment methods have been proposed and have been shown to improve sensitivity and alignment quality compared with sequence-sequence methods (such as BLAST) and profile-sequence methods (e.g. PSI-BLAST). Here we present a new approach to profile-profile alignment we call Comparison of Alignments by Constructing Hidden Markov Models (HMMs) (COACH). COACH aligns two multiple sequence alignments by constructing a profile HMM from one alignment and aligning the other to that HMM. We compare the alignment accuracy of COACH with two recently published methods: Yona and Levitt's prof_sim and Sadreyev and Grishin's COMPASS. On two sets of reference alignments selected from the FSSP database, we find that COACH is able, on average, to produce alignments giving the best coverage or the fewest errors, depending on the chosen parameter settings. COACH is freely available from www.drive5.com/lobster

Establishing homologies in protein sequences

NASA Technical Reports Server (NTRS)

Dayhoff, M. O.; Barker, W. C.; Hunt, L. T.

1983-01-01

Computer-based statistical techniques used to determine homologies between proteins occurring in different species are reviewed. The technique is based on comparison of two protein sequences, either by relating all segments of a given length in one sequence to all segments of the second or by finding the best alignment of the two sequences. Approaches discussed include selection using printed tabulations, identification of very similar sequences, and computer searches of a database. The use of the SEARCH, RELATE, and ALIGN programs (Dayhoff, 1979) is explained; sample data are presented in graphs, diagrams, and tables and the construction of scoring matrices is considered.

Proteins related to green algal striated fiber assemblin are present in stramenopiles and alveolates.

PubMed

Harper, John D I; Thuet, Jacques; Lechtreck, Karl F; Hardham, Adrienne R

2009-07-01

In green algae, striated fiber assemblin (SFA) is the major protein of the striated microtubule-associated fibers that are structural elements in the flagellar basal apparatus. Using Basic Local Alignment Search Tool (BLAST) searches of recently established databases, SFA-like sequences were detected in the genomes not only of green algal species but also of a range of other protists. These included species in two alveolate subgroups, the ciliates (Tetrahymena thermophila, Paramecium tetraurelia) and the dinoflagellates (Perkinsus marinus), and two stramenopile subgroups, the oomycetes (Phytophthora sojae, Phytophthora ramorum, Phytophthora infestans) and the diatoms (Thalassiosira pseudonana, Phaeodactylum tricornutum). Together with earlier identification of SFA-like sequences in the apicomplexans, these results indicate that homologs of SFA are present across the alveolates and stramenopiles. Antibodies raised against SFA from the green alga, Spermatozopsis similis, react in immunofluorescence assays with the two basal bodies and an anteriorly directed striated fiber in the flagellar apparatus of biflagellate Phytophthora zoospores.

Molecular Identification of Fungal Contamination in Date Palm Tissue Cultures.

PubMed

Abass, Mohammed H

2017-01-01

Fungal contamination of in vitro cultures of date palm (Phoenix dactylifera L.) is the major constraint to their initiation and maintenance. Different molecular approaches have been applied successfully to analyze both inter- and intraspecific variation among fungal species as well as determine their identity. This chapter describes step-by-step procedures of molecular identification of fungal contaminants by internal transcribed spacer (ITS) products of the most common fungal contaminants of date palm tissue culture. To begin with, samples of genera Alternaria, Aspergillus, Cladosporium, Epicoccum, and Penicillium were collected to isolate each fungal genus and extraction of genomic DNA. Polymerase chain reactions were accomplished by ITS primers (ITS1 and ITS4) for each fungal contaminant as well as for sequencing. Subsequently, they are analyzed by Basic Local Alignment Search Tool (BLAST) search of ITS sequence to reveal the identity of each individual fungal contaminant species. The molecular identification herein is a rapid and reliable procedure to identify date palm fungal contaminants which is very important in their control and treatment.

Search for Gravitational Waves Associated with Gamma-Ray Bursts during the First Advanced LIGO Observing Run and Implications for the Origin of GRB 150906B

NASA Astrophysics Data System (ADS)

Abbott, B. P.; Abbott, R.; Abbott, T. D.; Abernathy, M. R.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Adya, V. B.; Affeldt, C.; Agathos, M.; Agatsuma, K.; Aggarwal, N.; Aguiar, O. D.; Aiello, L.; Ain, A.; Ajith, P.; Allen, B.; Allocca, A.; Altin, P. A.; Ananyeva, A.; Anderson, S. B.; Anderson, W. G.; Appert, S.; Arai, K.; Araya, M. C.; Areeda, J. S.; Arnaud, N.; Arun, K. G.; Ascenzi, S.; Ashton, G.; Ast, M.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Avila-Alvarez, A.; Babak, S.; Bacon, P.; Bader, M. K. M.; Baker, P. T.; Baldaccini, F.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barclay, S. E.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barta, D.; Bartlett, J.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Baune, C.; Bavigadda, V.; Bazzan, M.; Bécsy, B.; Beer, C.; Bejger, M.; Belahcene, I.; Belgin, M.; Bell, A. S.; Berger, B. K.; Bergmann, G.; Berry, C. P. L.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Bhagwat, S.; Bhandare, R.; Bilenko, I. A.; Billingsley, G.; Billman, C. R.; Birch, J.; Birney, R.; Birnholtz, O.; Biscans, S.; Bisht, A.; Bitossi, M.; Biwer, C.; Bizouard, M. A.; Blackburn, J. K.; Blackman, J.; Blair, C. D.; Blair, D. G.; Blair, R. M.; Bloemen, S.; Bock, O.; Boer, M.; Bogaert, G.; Bohe, A.; Bondu, F.; Bonnand, R.; Boom, B. A.; Bork, R.; Boschi, V.; Bose, S.; Bouffanais, Y.; Bozzi, A.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brockill, P.; Broida, J. E.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brown, N. M.; Brunett, S.; Buchanan, C. C.; Buikema, A.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Byer, R. L.; Cabero, M.; Cadonati, L.; Cagnoli, G.; Cahillane, C.; Calderón Bustillo, J.; Callister, T. A.; Calloni, E.; Camp, J. B.; Canepa, M.; Cannon, K. C.; Cao, H.; Cao, J.; Capano, C. D.; Capocasa, E.; Carbognani, F.; Caride, S.; Casanueva Diaz, J.; Casentini, C.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C. B.; Cerboni Baiardi, L.; Cerretani, G.; Cesarini, E.; Chamberlin, S. J.; Chan, M.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Cheeseboro, B. D.; Chen, H. Y.; Chen, Y.; Cheng, H.-P.; Chincarini, A.; Chiummo, A.; Chmiel, T.; Cho, H. S.; Cho, M.; Chow, J. H.; Christensen, N.; Chu, Q.; Chua, A. J. K.; Chua, S.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Cleva, F.; Cocchieri, C.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Collette, C. G.; Cominsky, L.; Constancio, M., Jr.; Conti, L.; Cooper, S. J.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Cortese, S.; Costa, C. A.; Coughlin, M. W.; Coughlin, S. B.; Coulon, J.-P.; Countryman, S. T.; Couvares, P.; Covas, P. B.; Cowan, E. E.; Coward, D. M.; Cowart, M. J.; Coyne, D. C.; Coyne, R.; Creighton, J. D. E.; Creighton, T. D.; Cripe, J.; Crowder, S. G.; Cullen, T. J.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dal Canton, T.; Dálya, G.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dasgupta, A.; Da Silva Costa, C. F.; Dattilo, V.; Dave, I.; Davier, M.; Davies, G. S.; Davis, D.; Daw, E. J.; Day, B.; Day, R.; De, S.; DeBra, D.; Debreczeni, G.; Degallaix, J.; De Laurentis, M.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Devenson, J.; Devine, R. C.; Dhurandhar, S.; Díaz, M. C.; Di Fiore, L.; Di Giovanni, M.; Di Girolamo, T.; Di Lieto, A.; Di Pace, S.; Di Palma, I.; Di Virgilio, A.; Doctor, Z.; Dolique, V.; Donovan, F.; Dooley, K. L.; Doravari, S.; Dorrington, I.; Douglas, R.; Dovale Álvarez, M.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Ducrot, M.; Dwyer, S. E.; Edo, T. B.; Edwards, M. C.; Effler, A.; Eggenstein, H.-B.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Eisenstein, R. A.; Essick, R. C.; Etienne, Z.; Etzel, T.; Evans, M.; Evans, T. M.; Everett, R.; Factourovich, M.; Fafone, V.; Fair, H.; Fairhurst, S.; Fan, X.; Farinon, S.; Farr, B.; Farr, W. M.; Fauchon-Jones, E. J.; Favata, M.; Fays, M.; Fehrmann, H.; Fejer, M. M.; Fernández Galiana, A.; Ferrante, I.; Ferreira, E. C.; Ferrini, F.; Fidecaro, F.; Fiori, I.; Fiorucci, D.; Fisher, R. P.; Flaminio, R.; Fletcher, M.; Fong, H.; Forsyth, S. S.; Fournier, J.-D.; Frasca, S.; Frasconi, F.; Frei, Z.; Freise, A.; Frey, R.; Frey, V.; Fries, E. M.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gabbard, H.; Gadre, B. U.; Gaebel, S. M.; Gair, J. R.; Gammaitoni, L.; Gaonkar, S. G.; Garufi, F.; Gaur, G.; Gayathri, V.; Gehrels, N.; Gemme, G.; Genin, E.; Gennai, A.; George, J.; Gergely, L.; Germain, V.; Ghonge, S.; Ghosh, Abhirup; Ghosh, A.; Ghosh, Archisman; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, K.; Glaefke, A.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gonzalez Castro, J. M.; Gopakumar, A.; Gorodetsky, M. L.; Gossan, S. E.; Gosselin, M.; Gouaty, R.; Grado, A.; Graef, C.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greco, G.; Green, A. C.; Groot, P.; Grote, H.; Grunewald, S.; Guidi, G. M.; Guo, X.; Gupta, A.; Gupta, M. K.; Gushwa, K. E.; Gustafson, E. K.; Gustafson, R.; Hacker, J. J.; Hall, B. R.; Hall, E. D.; Hammond, G.; Haney, M.; Hanke, M. M.; Hanks, J.; Hanna, C.; Hanson, J.; Hardwick, T.; Harms, J.; Harry, G. M.; Harry, I. W.; Hart, M. J.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Healy, J.; Heidmann, A.; Heintze, M. C.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Hennig, J.; Henry, J.; Heptonstall, A. W.; Heurs, M.; Hild, S.; Hoak, D.; Hofman, D.; Holt, K.; Holz, D. E.; Hopkins, P.; Hough, J.; Houston, E. A.; Howell, E. J.; Hu, Y. M.; Huerta, E. A.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Indik, N.; Ingram, D. R.; Inta, R.; Isa, H. N.; Isac, J.-M.; Isi, M.; Isogai, T.; Iyer, B. R.; Izumi, K.; Jacqmin, T.; Jani, K.; Jaranowski, P.; Jawahar, S.; Jiménez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, R.; Jonker, R. J. G.; Ju, L.; Junker, J.; Kalaghatgi, C. V.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karki, S.; Karvinen, K. S.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, S.; Kaur, T.; Kawabe, K.; Kéfélian, F.; Keitel, D.; Kelley, D. B.; Kennedy, R.; Key, J. S.; Khalili, F. Y.; Khan, I.; Khan, S.; Khan, Z.; Khazanov, E. A.; Kijbunchoo, N.; Kim, Chunglee; Kim, J. C.; Kim, Whansun; Kim, W.; Kim, Y.-M.; Kimbrell, S. J.; King, E. J.; King, P. J.; Kirchhoff, R.; Kissel, J. S.; Klein, B.; Kleybolte, L.; Klimenko, S.; Koch, P.; Koehlenbeck, S. M.; Koley, S.; Kondrashov, V.; Kontos, A.; Korobko, M.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Krämer, C.; Kringel, V.; Krishnan, B.; Królak, A.; Kuehn, G.; Kumar, P.; Kumar, R.; Kuo, L.; Kutynia, A.; Lackey, B. D.; Landry, M.; Lang, R. N.; Lange, J.; Lantz, B.; Lanza, R. K.; Lartaux-Vollard, A.; Lasky, P. D.; Laxen, M.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C. H.; Lee, H. K.; Lee, H. M.; Lee, K.; Lehmann, J.; Lenon, A.; Leonardi, M.; Leong, J. R.; Leroy, N.; Letendre, N.; Levin, Y.; Li, T. G. F.; Libson, A.; Littenberg, T. B.; Liu, J.; Lockerbie, N. A.; Lombardi, A. L.; London, L. T.; Lord, J. E.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J. D.; Lovelace, G.; Lück, H.; Lundgren, A. P.; Lynch, R.; Ma, Y.; Macfoy, S.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magaña-Sandoval, F.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Mandic, V.; Mangano, V.; Mansell, G. L.; Manske, M.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A. S.; Maros, E.; Martelli, F.; Martellini, L.; Martin, I. W.; Martynov, D. V.; Mason, K.; Masserot, A.; Massinger, T. J.; Masso-Reid, M.; Mastrogiovanni, S.; Matichard, F.; Matone, L.; Mavalvala, N.; Mazumder, N.; McCarthy, R.; McClelland, D. E.; McCormick, S.; McGrath, C.; McGuire, S. C.; McIntyre, G.; McIver, J.; McManus, D. J.; McRae, T.; McWilliams, S. T.; Meacher, D.; Meadors, G. D.; Meidam, J.; Melatos, A.; Mendell, G.; Mendoza-Gandara, D.; Mercer, R. A.; Merilh, E. L.; Merzougui, M.; Meshkov, S.; Messenger, C.; Messick, C.; Metzdorff, R.; Meyers, P. M.; Mezzani, F.; Miao, H.; Michel, C.; Middleton, H.; Mikhailov, E. E.; Milano, L.; Miller, A. L.; Miller, A.; Miller, B. B.; Miller, J.; Millhouse, M.; Minenkov, Y.; Ming, J.; Mirshekari, S.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moggi, A.; Mohan, M.; Mohapatra, S. R. P.; Montani, M.; Moore, B. C.; Moore, C. J.; Moraru, D.; Moreno, G.; Morriss, S. R.; Mours, B.; Mow-Lowry, C. M.; Mueller, G.; Muir, A. W.; Mukherjee, Arunava; Mukherjee, D.; Mukherjee, S.; Mukund, N.; Mullavey, A.; Munch, J.; Muniz, E. A. M.; Murray, P. G.; Mytidis, A.; Napier, K.; Nardecchia, I.; Naticchioni, L.; Nelemans, G.; Nelson, T. J. N.; Neri, M.; Nery, M.; Neunzert, A.; Newport, J. M.; Newton, G.; Nguyen, T. T.; Nielsen, A. B.; Nissanke, S.; Nitz, A.; Noack, A.; Nocera, F.; Nolting, D.; Normandin, M. E. N.; Nuttall, L. K.; Oberling, J.; Ochsner, E.; Oelker, E.; Ogin, G. H.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oliver, M.; Oppermann, P.; Oram, Richard J.; O'Reilly, B.; O'Shaughnessy, R.; Ottaway, D. J.; Overmier, H.; Owen, B. J.; Pace, A. E.; Page, J.; Pai, A.; Pai, S. A.; Palamos, J. R.; Palashov, O.; Palomba, C.; Pal-Singh, A.; Pan, H.; Pankow, C.; Pannarale, F.; Pant, B. C.; Paoletti, F.; Paoli, A.; Papa, M. A.; Paris, H. R.; Parker, W.; Pascucci, D.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patricelli, B.; Pearlstone, B. L.; Pedraza, M.; Pedurand, R.; Pekowsky, L.; Pele, A.; Penn, S.; Perez, C. J.; Perreca, A.; Perri, L. M.; Pfeiffer, H. P.; Phelps, M.; Piccinni, O. J.; Pichot, M.; Piergiovanni, F.; Pierro, V.; Pillant, G.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poe, M.; Poggiani, R.; Popolizio, P.; Post, A.; Powell, J.; Prasad, J.; Pratt, J. W. W.; Predoi, V.; Prestegard, T.; Prijatelj, M.; Principe, M.; Privitera, S.; Prodi, G. A.; Prokhorov, L. G.; Puncken, O.; Punturo, M.; Puppo, P.; Pürrer, M.; Qi, H.; Qin, J.; Qiu, S.; Quetschke, V.; Quintero, E. A.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Radkins, H.; Raffai, P.; Raja, S.; Rajan, C.; Rakhmanov, M.; Rapagnani, P.; Raymond, V.; Razzano, M.; Re, V.; Read, J.; Regimbau, T.; Rei, L.; Reid, S.; Reitze, D. H.; Rew, H.; Reyes, S. D.; Rhoades, E.; Ricci, F.; Riles, K.; Rizzo, M.; Robertson, N. A.; Robie, R.; Robinet, F.; Rocchi, A.; Rolland, L.; Rollins, J. G.; Roma, V. J.; Romano, R.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Sachdev, S.; Sadecki, T.; Sadeghian, L.; Sakellariadou, M.; Salconi, L.; Saleem, M.; Salemi, F.; Samajdar, A.; Sammut, L.; Sampson, L. M.; Sanchez, E. J.; Sandberg, V.; Sanders, J. R.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Sauter, O.; Savage, R. L.; Sawadsky, A.; Schale, P.; Scheuer, J.; Schmidt, E.; Schmidt, J.; Schmidt, P.; Schnabel, R.; Schofield, R. M. S.; Schönbeck, A.; Schreiber, E.; Schuette, D.; Schwalbe, S. G.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Setyawati, Y.; Shaddock, D. A.; Shaffer, T. J.; Shahriar, M. S.; Shapiro, B.; Shawhan, P.; Sheperd, A.; Shoemaker, D. H.; Shoemaker, D. M.; Siellez, K.; Siemens, X.; Sieniawska, M.; Sigg, D.; Silva, A. D.; Singer, A.; Singer, L. P.; Singh, A.; Singh, R.; Singhal, A.; Sintes, A. M.; Slagmolen, B. J. J.; Smith, B.; Smith, J. R.; Smith, R. J. E.; Son, E. J.; Sorazu, B.; Sorrentino, F.; Souradeep, T.; Spencer, A. P.; Srivastava, A. K.; Staley, A.; Steinke, M.; Steinlechner, J.; Steinlechner, S.; Steinmeyer, D.; Stephens, B. C.; Stevenson, S. P.; Stone, R.; Strain, K. A.; Straniero, N.; Stratta, G.; Strigin, S. E.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sun, L.; Sunil, S.; Sutton, P. J.; Swinkels, B. L.; Szczepańczyk, M. J.; Szolgyen, A.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tápai, M.; Taracchini, A.; Taylor, R.; Theeg, T.; Thomas, E. G.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thrane, E.; Tippens, T.; Tiwari, S.; Tiwari, V.; Tokmakov, K. V.; Toland, K.; Tomlinson, C.; Tonelli, M.; Tornasi, Z.; Torrie, C. I.; Töyrä, D.; Travasso, F.; Traylor, G.; Trifirò, D.; Trinastic, J.; Tringali, M. C.; Trozzo, L.; Tse, M.; Tso, R.; Turconi, M.; Tuyenbayev, D.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Usman, S. A.; Vahlbruch, H.; Vajente, G.; Valdes, G.; van Bakel, N.; van Beuzekom, M.; van den Brand, J. F. J.; Van Den Broeck, C.; Vander-Hyde, D. C.; van der Schaaf, L.; van Heijningen, J. V.; van Veggel, A. A.; Vardaro, M.; Varma, V.; Vass, S.; Vasúth, M.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Venugopalan, G.; Verkindt, D.; Vetrano, F.; Viceré, A.; Viets, A. D.; Vinciguerra, S.; Vine, D. J.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Voss, D. V.; Vousden, W. D.; Vyatchanin, S. P.; Wade, A. R.; Wade, L. E.; Wade, M.; Walker, M.; Wallace, L.; Walsh, S.; Wang, G.; Wang, H.; Wang, M.; Wang, Y.; Ward, R. L.; Warner, J.; Was, M.; Watchi, J.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Wen, L.; Weßels, P.; Westphal, T.; Wette, K.; Whelan, J. T.; Whiting, B. F.; Whittle, C.; Williams, D.; Williams, R. D.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M. H.; Winkler, W.; Wipf, C. C.; Wittel, H.; Woan, G.; Woehler, J.; Worden, J.; Wright, J. L.; Wu, D. S.; Wu, G.; Yam, W.; Yamamoto, H.; Yancey, C. C.; Yap, M. J.; Yu, Hang; Yu, Haocun; Yvert, M.; Zadrożny, A.; Zangrando, L.; Zanolin, M.; Zendri, J.-P.; Zevin, M.; Zhang, L.; Zhang, M.; Zhang, T.; Zhang, Y.; Zhao, C.; Zhou, M.; Zhou, Z.; Zhu, X. J.; Zucker, M. E.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration; Aptekar, R. L.; Frederiks, D. D.; Golenetskii, S. V.; Golovin, D. V.; Hurley, K.; Litvak, M. L.; Mitrofanov, I. G.; Rau, A.; Sanin, A. B.; Svinkin, D. S.; von Kienlin, A.; Zhang, X.; IPN Collaboration

2017-06-01

We present the results of the search for gravitational waves (GWs) associated with γ-ray bursts detected during the first observing run of the Advanced Laser Interferometer Gravitational-Wave Observatory (LIGO). We find no evidence of a GW signal for any of the 41 γ-ray bursts for which LIGO data are available with sufficient duration. For all γ-ray bursts, we place lower bounds on the distance to the source using the optimistic assumption that GWs with an energy of {10}-2{M}⊙ {c}2 were emitted within the 16-500 Hz band, and we find a median 90% confidence limit of 71 Mpc at 150 Hz. For the subset of 19 short/hard γ-ray bursts, we place lower bounds on distance with a median 90% confidence limit of 90 Mpc for binary neutron star (BNS) coalescences, and 150 and 139 Mpc for neutron star-black hole coalescences with spins aligned to the orbital angular momentum and in a generic configuration, respectively. These are the highest distance limits ever achieved by GW searches. We also discuss in detail the results of the search for GWs associated with GRB 150906B, an event that was localized by the InterPlanetary Network near the local galaxy NGC 3313, which is at a luminosity distance of 54 Mpc (z = 0.0124). Assuming the γ-ray emission is beamed with a jet half-opening angle ≤slant 30^\\circ , we exclude a BNS and a neutron star-black hole in NGC 3313 as the progenitor of this event with confidence >99%. Further, we exclude such progenitors up to a distance of 102 Mpc and 170 Mpc, respectively.

Optimizing high performance computing workflow for protein functional annotation.

PubMed

Stanberry, Larissa; Rekepalli, Bhanu; Liu, Yuan; Giblock, Paul; Higdon, Roger; Montague, Elizabeth; Broomall, William; Kolker, Natali; Kolker, Eugene

2014-09-10

Functional annotation of newly sequenced genomes is one of the major challenges in modern biology. With modern sequencing technologies, the protein sequence universe is rapidly expanding. Newly sequenced bacterial genomes alone contain over 7.5 million proteins. The rate of data generation has far surpassed that of protein annotation. The volume of protein data makes manual curation infeasible, whereas a high compute cost limits the utility of existing automated approaches. In this work, we present an improved and optmized automated workflow to enable large-scale protein annotation. The workflow uses high performance computing architectures and a low complexity classification algorithm to assign proteins into existing clusters of orthologous groups of proteins. On the basis of the Position-Specific Iterative Basic Local Alignment Search Tool the algorithm ensures at least 80% specificity and sensitivity of the resulting classifications. The workflow utilizes highly scalable parallel applications for classification and sequence alignment. Using Extreme Science and Engineering Discovery Environment supercomputers, the workflow processed 1,200,000 newly sequenced bacterial proteins. With the rapid expansion of the protein sequence universe, the proposed workflow will enable scientists to annotate big genome data.

Optimizing high performance computing workflow for protein functional annotation

PubMed Central

Stanberry, Larissa; Rekepalli, Bhanu; Liu, Yuan; Giblock, Paul; Higdon, Roger; Montague, Elizabeth; Broomall, William; Kolker, Natali; Kolker, Eugene

2014-01-01

Functional annotation of newly sequenced genomes is one of the major challenges in modern biology. With modern sequencing technologies, the protein sequence universe is rapidly expanding. Newly sequenced bacterial genomes alone contain over 7.5 million proteins. The rate of data generation has far surpassed that of protein annotation. The volume of protein data makes manual curation infeasible, whereas a high compute cost limits the utility of existing automated approaches. In this work, we present an improved and optmized automated workflow to enable large-scale protein annotation. The workflow uses high performance computing architectures and a low complexity classification algorithm to assign proteins into existing clusters of orthologous groups of proteins. On the basis of the Position-Specific Iterative Basic Local Alignment Search Tool the algorithm ensures at least 80% specificity and sensitivity of the resulting classifications. The workflow utilizes highly scalable parallel applications for classification and sequence alignment. Using Extreme Science and Engineering Discovery Environment supercomputers, the workflow processed 1,200,000 newly sequenced bacterial proteins. With the rapid expansion of the protein sequence universe, the proposed workflow will enable scientists to annotate big genome data. PMID:25313296

Efficient and robust model-to-image alignment using 3D scale-invariant features.

PubMed

Toews, Matthew; Wells, William M

2013-04-01

This paper presents feature-based alignment (FBA), a general method for efficient and robust model-to-image alignment. Volumetric images, e.g. CT scans of the human body, are modeled probabilistically as a collage of 3D scale-invariant image features within a normalized reference space. Features are incorporated as a latent random variable and marginalized out in computing a maximum a posteriori alignment solution. The model is learned from features extracted in pre-aligned training images, then fit to features extracted from a new image to identify a globally optimal locally linear alignment solution. Novel techniques are presented for determining local feature orientation and efficiently encoding feature intensity in 3D. Experiments involving difficult magnetic resonance (MR) images of the human brain demonstrate FBA achieves alignment accuracy similar to widely-used registration methods, while requiring a fraction of the memory and computation resources and offering a more robust, globally optimal solution. Experiments on CT human body scans demonstrate FBA as an effective system for automatic human body alignment where other alignment methods break down. Copyright © 2012 Elsevier B.V. All rights reserved.

Efficient and Robust Model-to-Image Alignment using 3D Scale-Invariant Features

PubMed Central

Toews, Matthew; Wells, William M.

2013-01-01

This paper presents feature-based alignment (FBA), a general method for efficient and robust model-to-image alignment. Volumetric images, e.g. CT scans of the human body, are modeled probabilistically as a collage of 3D scale-invariant image features within a normalized reference space. Features are incorporated as a latent random variable and marginalized out in computing a maximum a-posteriori alignment solution. The model is learned from features extracted in pre-aligned training images, then fit to features extracted from a new image to identify a globally optimal locally linear alignment solution. Novel techniques are presented for determining local feature orientation and efficiently encoding feature intensity in 3D. Experiments involving difficult magnetic resonance (MR) images of the human brain demonstrate FBA achieves alignment accuracy similar to widely-used registration methods, while requiring a fraction of the memory and computation resources and offering a more robust, globally optimal solution. Experiments on CT human body scans demonstrate FBA as an effective system for automatic human body alignment where other alignment methods break down. PMID:23265799

Approximate matching of regular expressions.

PubMed

Myers, E W; Miller, W

1989-01-01

Given a sequence A and regular expression R, the approximate regular expression matching problem is to find a sequence matching R whose optimal alignment with A is the highest scoring of all such sequences. This paper develops an algorithm to solve the problem in time O(MN), where M and N are the lengths of A and R. Thus, the time requirement is asymptotically no worse than for the simpler problem of aligning two fixed sequences. Our method is superior to an earlier algorithm by Wagner and Seiferas in several ways. First, it treats real-valued costs, in addition to integer costs, with no loss of asymptotic efficiency. Second, it requires only O(N) space to deliver just the score of the best alignment. Finally, its structure permits implementation techniques that make it extremely fast in practice. We extend the method to accommodate gap penalties, as required for typical applications in molecular biology, and further refine it to search for sub-strings of A that strongly align with a sequence in R, as required for typical data base searches. We also show how to deliver an optimal alignment between A and R in only O(N + log M) space using O(MN log M) time. Finally, an O(MN(M + N) + N2log N) time algorithm is presented for alignment scoring schemes where the cost of a gap is an arbitrary increasing function of its length.

SU-F-P-30: Clinical Assessment of Auto Beam-Hold Triggered by Fiducial Localization During Prostate RapidArc Delivery

DOE Office of Scientific and Technical Information (OSTI.GOV)

Atkinson, P; Chen, Q

2016-06-15

Purpose: To assess the clinical efficacy of auto beam hold during prostate RapidArc delivery, triggered by fiducial localization on kV imaging with a Varian True Beam. Methods: Prostate patients with four gold fiducials were candidates in this study. Daily setup was accomplished by aligning to fiducials using orthogonal kV imaging. During RapidArc delivery, a kV image was automatically acquired with a momentary beam hold every 60 degrees of gantry rotation. The position of each fiducial was identified by a search algorithm and compared to a predetermined 1.4 cm diameter target area. Treatment continued if all the fiducials were within themore » target area. If any fiducial was outside the target area the beam hold was not released, and the operators determined if the patient needed re-alignment using the daily setup method. Results: Four patients were initially selected. For three patients, the auto beam hold performed seamlessly. In one instance, the system correctly identified misaligned fiducials, stopped treatment, and the patient was re-positioned. The fourth patient had a prosthetic hip which sometimes blocked the fiducials and caused the fiducial search algorithm to fail. The auto beam hold was disabled for this patient and the therapists manually monitored the fiducial positions during treatment. Average delivery time for a 2-arc fraction was increased by 59 seconds. Phantom studies indicated the dose discrepancy related to multiple beam holds is <0.1%. For a plan with 43 fractions, the additional imaging increased dose by an estimated 68 cGy. Conclusion: Automated intrafraction kV imaging can effectively perform auto beam holds due to patient movement, with the exception of prosthetic hip patients. The additional imaging dose and delivery time are clinically acceptable. It may be a cost-effective alternative to Calypso in RapidArc prostate patient delivery. Further study is warranted to explore its feasibility under various clinical conditions.« less

rasbhari: Optimizing Spaced Seeds for Database Searching, Read Mapping and Alignment-Free Sequence Comparison.

PubMed

Hahn, Lars; Leimeister, Chris-André; Ounit, Rachid; Lonardi, Stefano; Morgenstern, Burkhard

2016-10-01

Many algorithms for sequence analysis rely on word matching or word statistics. Often, these approaches can be improved if binary patterns representing match and don't-care positions are used as a filter, such that only those positions of words are considered that correspond to the match positions of the patterns. The performance of these approaches, however, depends on the underlying patterns. Herein, we show that the overlap complexity of a pattern set that was introduced by Ilie and Ilie is closely related to the variance of the number of matches between two evolutionarily related sequences with respect to this pattern set. We propose a modified hill-climbing algorithm to optimize pattern sets for database searching, read mapping and alignment-free sequence comparison of nucleic-acid sequences; our implementation of this algorithm is called rasbhari. Depending on the application at hand, rasbhari can either minimize the overlap complexity of pattern sets, maximize their sensitivity in database searching or minimize the variance of the number of pattern-based matches in alignment-free sequence comparison. We show that, for database searching, rasbhari generates pattern sets with slightly higher sensitivity than existing approaches. In our Spaced Words approach to alignment-free sequence comparison, pattern sets calculated with rasbhari led to more accurate estimates of phylogenetic distances than the randomly generated pattern sets that we previously used. Finally, we used rasbhari to generate patterns for short read classification with CLARK-S. Here too, the sensitivity of the results could be improved, compared to the default patterns of the program. We integrated rasbhari into Spaced Words; the source code of rasbhari is freely available at http://rasbhari.gobics.de/.

Fidelity of Implementation and Instructional Alignment in Response to Intervention Research

ERIC Educational Resources Information Center

Hill, David R.; King, Seth A.; Lemons, Christopher J.; Partanen, Jane N.

2012-01-01

In this review, we explore the extent to which researchers evaluating the efficacy of Tier 2 elementary reading interventions within the framework of Response to Intervention reported on fidelity of implementation and alignment of instruction between tiers. A literature search identified 22 empirical studies from which conclusions were drawn.…

The salinity tolerant poplar database (STPD): a comprehensive database for studying tree salt-tolerant adaption and poplar genomics.

PubMed

Ma, Yazhen; Xu, Ting; Wan, Dongshi; Ma, Tao; Shi, Sheng; Liu, Jianquan; Hu, Quanjun

2015-03-17

Soil salinity is a significant factor that impairs plant growth and agricultural productivity, and numerous efforts are underway to enhance salt tolerance of economically important plants. Populus species are widely cultivated for diverse uses. Especially, they grow in different habitats, from salty soil to mesophytic environment, and are therefore used as a model genus for elucidating physiological and molecular mechanisms of stress tolerance in woody plants. The Salinity Tolerant Poplar Database (STPD) is an integrative database for salt-tolerant poplar genome biology. Currently the STPD contains Populus euphratica genome and its related genetic resources. P. euphratica, with a preference of the salty habitats, has become a valuable genetic resource for the exploitation of tolerance characteristics in trees. This database contains curated data including genomic sequence, genes and gene functional information, non-coding RNA sequences, transposable elements, simple sequence repeats and single nucleotide polymorphisms information of P. euphratica, gene expression data between P. euphratica and Populus tomentosa, and whole-genome alignments between Populus trichocarpa, P. euphratica and Salix suchowensis. The STPD provides useful searching and data mining tools, including GBrowse genome browser, BLAST servers and genome alignments viewer, which can be used to browse genome regions, identify similar sequences and visualize genome alignments. Datasets within the STPD can also be downloaded to perform local searches. A new Salinity Tolerant Poplar Database has been developed to assist studies of salt tolerance in trees and poplar genomics. The database will be continuously updated to incorporate new genome-wide data of related poplar species. This database will serve as an infrastructure for researches on the molecular function of genes, comparative genomics, and evolution in closely related species as well as promote advances in molecular breeding within Populus. The STPD can be accessed at http://me.lzu.edu.cn/stpd/ .

Effect of gravito-inertial cues on the coding of orientation in pre-attentive vision.

PubMed

Stivalet, P; Marendaz, C; Barraclough, L; Mourareau, C

1995-01-01

To see if the spatial reference frame used by pre-attentive vision is specified in a retino-centered frame or in a reference frame integrating visual and nonvisual information (vestibular and somatosensory), subjects were centrifuged in a non-pendular cabin and were asked to search for a target distinguishable from distractors by difference in orientation (Treisman's "pop-out" paradigm [1]). In a control condition, in which subjects were sitting immobilized but not centrifuged, this task gave an asymmetric search pattern: Search was rapid and pre-attentional except when the target was aligned with the horizontal retinal/head axis, in which case search was slow and attentional (2). Results using a centrifuge showed that slow/serial search patterns were obtained when the target was aligned with the subjective horizontal axis (and not with the horizontal retinal/head axis). These data suggest that a multisensory reference frame is used in pre-attentive vision. The results are interpreted in terms of Riccio and Stoffregen's "ecological theory" of orientation in which the vertical and horizontal axes constitute independent reference frames (3).

The Effect of Professional Learning Activities on Implementation of California's Quality Professional Learning Standards in Alignment with the Local Control Funding Formula Priority 2

ERIC Educational Resources Information Center

Pinotti, Sadie

2017-01-01

The purpose of this Delphi study was to identify the professional learning activities that experts perceive are necessary for local education agencies (LEAs) to effectively implement California's Quality Professional Learning Standards (QPLS) in alignment with the Local Control Funding Formula (LCFF) Priority 2. The study also examined the degree…

Barriers and facilitators to health information exchange in low- and middle-income country settings: a systematic review.

PubMed

Akhlaq, Ather; McKinstry, Brian; Muhammad, Khalid Bin; Sheikh, Aziz

2016-11-01

The exchange and use of health information can help healthcare professionals and policymakers make informed decisions on ways of improving patient and population health. Many low- and middle-income countries (LMICs) have however failed to embrace the approaches and technologies to facilitate health information exchange (HIE). We sought to understand the barriers and facilitators to the implementation and adoption of HIE in LMICs. Two reviewers independently searched 11 academic databases for published and on-going qualitative, quantitative and mixed-method studies and searched for unpublished work through the Google search engine. The searches covered the period from January 1990 to July 2014 and were not restricted by language. Eligible studies were independently, critically appraised and then thematically analysed. The searches yielded 5461 citations after de-duplication of results. Of these, 56 articles, three conference abstracts and four technical reports met the inclusion criteria. The lack of importance given to data in decision making, corruption and insecurity, lack of training and poor infrastructure were considered to be major challenges to implementing HIE, but strong leadership and clear policy direction coupled with the financial support to acquire essential technology, improve the communication network, and provide training for staff all helped to promote implementation. The body of work also highlighted how implementers of HIE needed to take into account local needs to ensure that stakeholders saw HIE as relevant and advantageous. HIE interventions implemented through leapfrog technologies such as telehealth/telemedicine and mHealth in Brazil, Kenya, and South Africa, provided successful examples of exchanging health information in LMICs despite limited resources and capability. It is important that implementation of HIE is aligned with national priorities and local needs. © The Author 2016. Published by Oxford University Press in association with The London School of Hygiene and Tropical Medicine. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

WEB-server for search of a periodicity in amino acid and nucleotide sequences

NASA Astrophysics Data System (ADS)

E Frenkel, F.; Skryabin, K. G.; Korotkov, E. V.

2017-12-01

A new web server (http://victoria.biengi.ac.ru/splinter/login.php) was designed and developed to search for periodicity in nucleotide and amino acid sequences. The web server operation is based upon a new mathematical method of searching for multiple alignments, which is founded on the position weight matrices optimization, as well as on implementation of the two-dimensional dynamic programming. This approach allows the construction of multiple alignments of the indistinctly similar amino acid and nucleotide sequences that accumulated more than 1.5 substitutions per a single amino acid or a nucleotide without performing the sequences paired comparisons. The article examines the principles of the web server operation and two examples of studying amino acid and nucleotide sequences, as well as information that could be obtained using the web server.

Shape-Based Virtual Screening with Volumetric Aligned Molecular Shapes

PubMed Central

Koes, David Ryan; Camacho, Carlos J.

2014-01-01

Shape-based virtual screening is an established and effective method for identifying small molecules that are similar in shape and function to a reference ligand. We describe a new method of shape-based virtual screening, volumetric aligned molecular shapes (VAMS). VAMS uses efficient data structures to encode and search molecular shapes. We demonstrate that VAMS is an effective method for shape-based virtual screening and that it can be successfully used as a pre-filter to accelerate more computationally demanding search algorithms. Unique to VAMS is a novel minimum/maximum shape constraint query for precisely specifying the desired molecular shape. Shape constraint searches in VAMS are particularly efficient and millions of shapes can be searched in a fraction of a second. We compare the performance of VAMS with two other shape-based virtual screening algorithms a benchmark of 102 protein targets consisting of more than 32 million molecular shapes and find that VAMS provides a competitive trade-off between run-time performance and virtual screening performance. PMID:25049193

BrainLiner: A Neuroinformatics Platform for Sharing Time-Aligned Brain-Behavior Data

PubMed Central

Takemiya, Makoto; Majima, Kei; Tsukamoto, Mitsuaki; Kamitani, Yukiyasu

2016-01-01

Data-driven neuroscience aims to find statistical relationships between brain activity and task behavior from large-scale datasets. To facilitate high-throughput data processing and modeling, we created BrainLiner as a web platform for sharing time-aligned, brain-behavior data. Using an HDF5-based data format, BrainLiner treats brain activity and data related to behavior with the same salience, aligning both behavioral and brain activity data on a common time axis. This facilitates learning the relationship between behavior and brain activity. Using a common data file format also simplifies data processing and analyses. Properties describing data are unambiguously defined using a schema, allowing machine-readable definition of data. The BrainLiner platform allows users to upload and download data, as well as to explore and search for data from the web platform. A WebGL-based data explorer can visualize highly detailed neurophysiological data from within the web browser, and a data-driven search feature allows users to search for similar time windows of data. This increases transparency, and allows for visual inspection of neural coding. BrainLiner thus provides an essential set of tools for data sharing and data-driven modeling. PMID:26858636

Alignment of galaxies relative to their local environment in SDSS-DR8

NASA Astrophysics Data System (ADS)

Hirv, A.; Pelt, J.; Saar, E.; Tago, E.; Tamm, A.; Tempel, E.; Einasto, M.

2017-03-01

Aims: We study the alignment of galaxies relative to their local environment in SDSS-DR8 and, using these data, we discuss evolution scenarios for different types of galaxies. Methods: We defined a vector field of the direction of anisotropy of the local environment of galaxies. We summed the unit direction vectors of all close neighbours of a given galaxy in a particular way to estimate this field. We found the alignment angles between the spin axes of disc galaxies, or the minor axes of elliptical galaxies, and the direction of anisotropy. The distributions of cosines of these angles are compared to the random distributions to analyse the alignment of galaxies. Results: Sab galaxies show perpendicular alignment relative to the direction of anisotropy in a sparse environment, for single galaxies and galaxies of low luminosity. Most of the parallel alignment of Scd galaxies comes from dense regions, from 2...3 member groups and from galaxies with low luminosity. The perpendicular alignment of S0 galaxies does not depend strongly on environmental density nor luminosity; it is detected for single and 2...3 member group galaxies, and for main galaxies of 4...10 member groups. The perpendicular alignment of elliptical galaxies is clearly detected for single galaxies and for members of ≤10 member groups; the alignment increases with environmental density and luminosity. Conclusions: We confirm the existence of fossil tidally induced alignment of Sab galaxies at low z. The alignment of Scd galaxies can be explained via the infall of matter to filaments. S0 galaxies may have encountered relatively massive mergers along the direction of anisotropy. Major mergers along this direction can explain the alignment of elliptical galaxies. Less massive, but repeated mergers are possibly responsible for the formation of elliptical galaxies in sparser areas and for less luminous elliptical galaxies.

ProBiS-database: precalculated binding site similarities and local pairwise alignments of PDB structures.

PubMed

Konc, Janez; Cesnik, Tomo; Konc, Joanna Trykowska; Penca, Matej; Janežič, Dušanka

2012-02-27

ProBiS-Database is a searchable repository of precalculated local structural alignments in proteins detected by the ProBiS algorithm in the Protein Data Bank. Identification of functionally important binding regions of the protein is facilitated by structural similarity scores mapped to the query protein structure. PDB structures that have been aligned with a query protein may be rapidly retrieved from the ProBiS-Database, which is thus able to generate hypotheses concerning the roles of uncharacterized proteins. Presented with uncharacterized protein structure, ProBiS-Database can discern relationships between such a query protein and other better known proteins in the PDB. Fast access and a user-friendly graphical interface promote easy exploration of this database of over 420 million local structural alignments. The ProBiS-Database is updated weekly and is freely available online at http://probis.cmm.ki.si/database.

GuiTope: an application for mapping random-sequence peptides to protein sequences.

PubMed

Halperin, Rebecca F; Stafford, Phillip; Emery, Jack S; Navalkar, Krupa Arun; Johnston, Stephen Albert

2012-01-03

Random-sequence peptide libraries are a commonly used tool to identify novel ligands for binding antibodies, other proteins, and small molecules. It is often of interest to compare the selected peptide sequences to the natural protein binding partners to infer the exact binding site or the importance of particular residues. The ability to search a set of sequences for similarity to a set of peptides may sometimes enable the prediction of an antibody epitope or a novel binding partner. We have developed a software application designed specifically for this task. GuiTope provides a graphical user interface for aligning peptide sequences to protein sequences. All alignment parameters are accessible to the user including the ability to specify the amino acid frequency in the peptide library; these frequencies often differ significantly from those assumed by popular alignment programs. It also includes a novel feature to align di-peptide inversions, which we have found improves the accuracy of antibody epitope prediction from peptide microarray data and shows utility in analyzing phage display datasets. Finally, GuiTope can randomly select peptides from a given library to estimate a null distribution of scores and calculate statistical significance. GuiTope provides a convenient method for comparing selected peptide sequences to protein sequences, including flexible alignment parameters, novel alignment features, ability to search a database, and statistical significance of results. The software is available as an executable (for PC) at http://www.immunosignature.com/software and ongoing updates and source code will be available at sourceforge.net.

The relative phases of basal ganglia activities dynamically shape effective connectivity in Parkinson's disease.

PubMed

Cagnan, Hayriye; Duff, Eugene Paul; Brown, Peter

2015-06-01

Optimal phase alignment between oscillatory neural circuits is hypothesized to optimize information flow and enhance system performance. This theory is known as communication-through-coherence. The basal ganglia motor circuit exhibits exaggerated oscillatory and coherent activity patterns in Parkinson's disease. Such activity patterns are linked to compromised motor system performance as evinced by bradykinesia, rigidity and tremor, suggesting that network function might actually deteriorate once a certain level of net synchrony is exceeded in the motor circuit. Here, we characterize the processes underscoring excessive synchronization and its termination. To this end, we analysed local field potential recordings from the subthalamic nucleus and globus pallidus of five patients with Parkinson's disease (four male and one female, aged 37-64 years). We observed that certain phase alignments between subthalamic nucleus and globus pallidus amplified local neural synchrony in the beta frequency band while others either suppressed it or did not induce any significant change with respect to surrogates. The increase in local beta synchrony directly correlated with how long the two nuclei locked to beta-amplifying phase alignments. Crucially, administration of the dopamine prodrug, levodopa, reduced the frequency and duration of periods during which subthalamic and pallidal populations were phase-locked to beta-amplifying alignments. Conversely ON dopamine, the total duration over which subthalamic and pallidal populations were aligned to phases that left beta-amplitude unchanged with respect to surrogates increased. Thus dopaminergic input shifted circuit dynamics from persistent periods of locking to amplifying phase alignments, associated with compromised motoric function, to more dynamic phase alignment and improved motoric function. This effect of dopamine on local circuit resonance suggests means by which novel electrical interventions might prevent resonance-related pathological circuit interactions. © The Author (2015). Published by Oxford University Press on behalf of the Guarantors of Brain.

Divide and Conquer (DC) BLAST: fast and easy BLAST execution within HPC environments

DOE PAGES

Yim, Won Cheol; Cushman, John C.

2017-07-22

Bioinformatics is currently faced with very large-scale data sets that lead to computational jobs, especially sequence similarity searches, that can take absurdly long times to run. For example, the National Center for Biotechnology Information (NCBI) Basic Local Alignment Search Tool (BLAST and BLAST+) suite, which is by far the most widely used tool for rapid similarity searching among nucleic acid or amino acid sequences, is highly central processing unit (CPU) intensive. While the BLAST suite of programs perform searches very rapidly, they have the potential to be accelerated. In recent years, distributed computing environments have become more widely accessible andmore » used due to the increasing availability of high-performance computing (HPC) systems. Therefore, simple solutions for data parallelization are needed to expedite BLAST and other sequence analysis tools. However, existing software for parallel sequence similarity searches often requires extensive computational experience and skill on the part of the user. In order to accelerate BLAST and other sequence analysis tools, Divide and Conquer BLAST (DCBLAST) was developed to perform NCBI BLAST searches within a cluster, grid, or HPC environment by using a query sequence distribution approach. Scaling from one (1) to 256 CPU cores resulted in significant improvements in processing speed. Thus, DCBLAST dramatically accelerates the execution of BLAST searches using a simple, accessible, robust, and parallel approach. DCBLAST works across multiple nodes automatically and it overcomes the speed limitation of single-node BLAST programs. DCBLAST can be used on any HPC system, can take advantage of hundreds of nodes, and has no output limitations. Thus, this freely available tool simplifies distributed computation pipelines to facilitate the rapid discovery of sequence similarities between very large data sets.« less

Divide and Conquer (DC) BLAST: fast and easy BLAST execution within HPC environments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yim, Won Cheol; Cushman, John C.

Bioinformatics is currently faced with very large-scale data sets that lead to computational jobs, especially sequence similarity searches, that can take absurdly long times to run. For example, the National Center for Biotechnology Information (NCBI) Basic Local Alignment Search Tool (BLAST and BLAST+) suite, which is by far the most widely used tool for rapid similarity searching among nucleic acid or amino acid sequences, is highly central processing unit (CPU) intensive. While the BLAST suite of programs perform searches very rapidly, they have the potential to be accelerated. In recent years, distributed computing environments have become more widely accessible andmore » used due to the increasing availability of high-performance computing (HPC) systems. Therefore, simple solutions for data parallelization are needed to expedite BLAST and other sequence analysis tools. However, existing software for parallel sequence similarity searches often requires extensive computational experience and skill on the part of the user. In order to accelerate BLAST and other sequence analysis tools, Divide and Conquer BLAST (DCBLAST) was developed to perform NCBI BLAST searches within a cluster, grid, or HPC environment by using a query sequence distribution approach. Scaling from one (1) to 256 CPU cores resulted in significant improvements in processing speed. Thus, DCBLAST dramatically accelerates the execution of BLAST searches using a simple, accessible, robust, and parallel approach. DCBLAST works across multiple nodes automatically and it overcomes the speed limitation of single-node BLAST programs. DCBLAST can be used on any HPC system, can take advantage of hundreds of nodes, and has no output limitations. Thus, this freely available tool simplifies distributed computation pipelines to facilitate the rapid discovery of sequence similarities between very large data sets.« less

SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters.

PubMed

Wang, Chunlin; Lefkowitz, Elliot J

2004-10-28

Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST) or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. We describe the implementation of SS-Wrapper (Similarity Search Wrapper), a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search) approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST) that provides a complementary solution for BLAST searches when the database is too large to fit into the memory of a single node. Used together, QS-search and DS-BLAST provide a flexible solution to adapt sequential similarity searching applications in high performance computing environments. Their ease of use and their ability to wrap a variety of database search programs provide an analytical architecture to assist both the seasoned bioinformaticist and the wet-bench biologist.

SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters

PubMed Central

Wang, Chunlin; Lefkowitz, Elliot J

2004-01-01

Background Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST) or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. Results We describe the implementation of SS-Wrapper (Similarity Search Wrapper), a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search) approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST) that provides a complementary solution for BLAST searches when the database is too large to fit into the memory of a single node. Conclusions Used together, QS-search and DS-BLAST provide a flexible solution to adapt sequential similarity searching applications in high performance computing environments. Their ease of use and their ability to wrap a variety of database search programs provide an analytical architecture to assist both the seasoned bioinformaticist and the wet-bench biologist. PMID:15511296

Text-image alignment for historical handwritten documents

NASA Astrophysics Data System (ADS)

Zinger, S.; Nerbonne, J.; Schomaker, L.

2009-01-01

We describe our work on text-image alignment in context of building a historical document retrieval system. We aim at aligning images of words in handwritten lines with their text transcriptions. The images of handwritten lines are automatically segmented from the scanned pages of historical documents and then manually transcribed. To train automatic routines to detect words in an image of handwritten text, we need a training set - images of words with their transcriptions. We present our results on aligning words from the images of handwritten lines and their corresponding text transcriptions. Alignment based on the longest spaces between portions of handwriting is a baseline. We then show that relative lengths, i.e. proportions of words in their lines, can be used to improve the alignment results considerably. To take into account the relative word length, we define the expressions for the cost function that has to be minimized for aligning text words with their images. We apply right to left alignment as well as alignment based on exhaustive search. The quality assessment of these alignments shows correct results for 69% of words from 100 lines, or 90% of partially correct and correct alignments combined.

Mesohysteresis model for ferromagnetic materials by minimization of the micromagnetic free energy

NASA Astrophysics Data System (ADS)

van den Berg, A.; Dupré, L.; Van de Wiele, B.; Crevecoeur, G.

2009-04-01

To study the connection between macroscopic hysteretic behavior and the microstructural properties, this paper presents and validates a new material dependent three-dimensional mesoscopic magnetic hysteresis model. In the presented mesoscopic description, the different micromagnetic energy terms are reformulated on the space scale of the magnetic domains. The sample is discretized in cubic cells, each with a local stress state, local bcc crystallographic axes, etc. The magnetization is assumed to align with one of the three crystallographic axes, in positive or negative sense, defining six volume fractions within each cell. The micromagnetic Gibbs free energy is described in terms of these volume fractions. Hysteresis loops are computed by minimizing the mesoscopic Gibbs free energy using a modified gradient search for a sequence of external applied fields. To validate the mesohysteresis model, we studied the magnetic memory properties. Numerical experiments reveal that (1) minor hysteresis loops are indeed closed and (2) the closed minor loops are erased from the memory.

Arioc: high-throughput read alignment with GPU-accelerated exploration of the seed-and-extend search space

PubMed Central

Budavari, Tamas; Langmead, Ben; Wheelan, Sarah J.; Salzberg, Steven L.; Szalay, Alexander S.

2015-01-01

When computing alignments of DNA sequences to a large genome, a key element in achieving high processing throughput is to prioritize locations in the genome where high-scoring mappings might be expected. We formulated this task as a series of list-processing operations that can be efficiently performed on graphics processing unit (GPU) hardware.We followed this approach in implementing a read aligner called Arioc that uses GPU-based parallel sort and reduction techniques to identify high-priority locations where potential alignments may be found. We then carried out a read-by-read comparison of Arioc’s reported alignments with the alignments found by several leading read aligners. With simulated reads, Arioc has comparable or better accuracy than the other read aligners we tested. With human sequencing reads, Arioc demonstrates significantly greater throughput than the other aligners we evaluated across a wide range of sensitivity settings. The Arioc software is available at https://github.com/RWilton/Arioc. It is released under a BSD open-source license. PMID:25780763

PhAST: pharmacophore alignment search tool.

PubMed

Hähnke, Volker; Hofmann, Bettina; Grgat, Tomislav; Proschak, Ewgenij; Steinhilber, Dieter; Schneider, Gisbert

2009-04-15

We present a ligand-based virtual screening technique (PhAST) for rapid hit and lead structure searching in large compound databases. Molecules are represented as strings encoding the distribution of pharmacophoric features on the molecular graph. In contrast to other text-based methods using SMILES strings, we introduce a new form of text representation that describes the pharmacophore of molecules. This string representation opens the opportunity for revealing functional similarity between molecules by sequence alignment techniques in analogy to homology searching in protein or nucleic acid sequence databases. We favorably compared PhAST with other current ligand-based virtual screening methods in a retrospective analysis using the BEDROC metric. In a prospective application, PhAST identified two novel inhibitors of 5-lipoxygenase product formation with minimal experimental effort. This outcome demonstrates the applicability of PhAST to drug discovery projects and provides an innovative concept of sequence-based compound screening with substantial scaffold hopping potential. 2008 Wiley Periodicals, Inc.

Reducing the number of templates for aligned-spin compact binary coalescence gravitational wave searches using metric-agnostic template nudging

NASA Astrophysics Data System (ADS)

Indik, Nathaniel; Fehrmann, Henning; Harke, Franz; Krishnan, Badri; Nielsen, Alex B.

2018-06-01

Efficient multidimensional template placement is crucial in computationally intensive matched-filtering searches for gravitational waves (GWs). Here, we implement the neighboring cell algorithm (NCA) to improve the detection volume of an existing compact binary coalescence (CBC) template bank. This algorithm has already been successfully applied for a binary millisecond pulsar search in data from the Fermi satellite. It repositions templates from overdense regions to underdense regions and reduces the number of templates that would have been required by a stochastic method to achieve the same detection volume. Our method is readily generalizable to other CBC parameter spaces. Here we apply this method to the aligned-single-spin neutron star-black hole binary coalescence inspiral-merger-ringdown gravitational wave parameter space. We show that the template nudging algorithm can attain the equivalent effectualness of the stochastic method with 12% fewer templates.

Southwest Research Institute astronomer Dan Durda checks the alignment of the SWUIS-A Xybion digital

NASA Technical Reports Server (NTRS)

2002-01-01

Southwest Research Institute astronomer Dan Durda checks the alignment of the SWUIS-A Xybion digital camera mounted in the rear cockpit of a NASA Dryden F/A-18B before taking off on an astronomy mission to search for small vulcanoids (asteroids) that may be orbiting between the sun and the planet Mercury.

rVISTA 2.0: Evolutionary Analysis of Transcription Factor Binding Sites

DOE Office of Scientific and Technical Information (OSTI.GOV)

Loots, G G; Ovcharenko, I

2004-01-28

Identifying and characterizing the patterns of DNA cis-regulatory modules represents a challenge that has the potential to reveal the regulatory language the genome uses to dictate transcriptional dynamics. Several studies have demonstrated that regulatory modules are under positive selection and therefore are often conserved between related species. Using this evolutionary principle we have created a comparative tool, rVISTA, for analyzing the regulatory potential of noncoding sequences. The rVISTA tool combines transcription factor binding site (TFBS) predictions, sequence comparisons and cluster analysis to identify noncoding DNA regions that are highly conserved and present in a specific configuration within an alignment. Heremore » we present the newly developed version 2.0 of the rVISTA tool that can process alignments generated by both zPicture and PipMaker alignment programs or use pre-computed pairwise alignments of seven vertebrate genomes available from the ECR Browser. The rVISTA web server is closely interconnected with the TRANSFAC database, allowing users to either search for matrices present in the TRANSFAC library collection or search for user-defined consensus sequences. rVISTA tool is publicly available at http://rvista.dcode.org/.« less

FEAST: sensitive local alignment with multiple rates of evolution.

PubMed

Hudek, Alexander K; Brown, Daniel G

2011-01-01

We present a pairwise local aligner, FEAST, which uses two new techniques: a sensitive extension algorithm for identifying homologous subsequences, and a descriptive probabilistic alignment model. We also present a new procedure for training alignment parameters and apply it to the human and mouse genomes, producing a better parameter set for these sequences. Our extension algorithm identifies homologous subsequences by considering all evolutionary histories. It has higher maximum sensitivity than Viterbi extensions, and better balances specificity. We model alignments with several submodels, each with unique statistical properties, describing strongly similar and weakly similar regions of homologous DNA. Training parameters using two submodels produces superior alignments, even when we align with only the parameters from the weaker submodel. Our extension algorithm combined with our new parameter set achieves sensitivity 0.59 on synthetic tests. In contrast, LASTZ with default settings achieves sensitivity 0.35 with the same false positive rate. Using the weak submodel as parameters for LASTZ increases its sensitivity to 0.59 with high error. FEAST is available at http://monod.uwaterloo.ca/feast/.

Fast 3D shape screening of large chemical databases through alignment-recycling

PubMed Central

Fontaine, Fabien; Bolton, Evan; Borodina, Yulia; Bryant, Stephen H

2007-01-01

Background Large chemical databases require fast, efficient, and simple ways of looking for similar structures. Although such tasks are now fairly well resolved for graph-based similarity queries, they remain an issue for 3D approaches, particularly for those based on 3D shape overlays. Inspired by a recent technique developed to compare molecular shapes, we designed a hybrid methodology, alignment-recycling, that enables efficient retrieval and alignment of structures with similar 3D shapes. Results Using a dataset of more than one million PubChem compounds of limited size (< 28 heavy atoms) and flexibility (< 6 rotatable bonds), we obtained a set of a few thousand diverse structures covering entirely the 3D shape space of the conformers of the dataset. Transformation matrices gathered from the overlays between these diverse structures and the 3D conformer dataset allowed us to drastically (100-fold) reduce the CPU time required for shape overlay. The alignment-recycling heuristic produces results consistent with de novo alignment calculation, with better than 80% hit list overlap on average. Conclusion Overlay-based 3D methods are computationally demanding when searching large databases. Alignment-recycling reduces the CPU time to perform shape similarity searches by breaking the alignment problem into three steps: selection of diverse shapes to describe the database shape-space; overlay of the database conformers to the diverse shapes; and non-optimized overlay of query and database conformers using common reference shapes. The precomputation, required by the first two steps, is a significant cost of the method; however, once performed, querying is two orders of magnitude faster. Extensions and variations of this methodology, for example, to handle more flexible and larger small-molecules are discussed. PMID:17880744

Using Variable-Length Aligned Fragment Pairs and an Improved Transition Function for Flexible Protein Structure Alignment.

PubMed

Cao, Hu; Lu, Yonggang

2017-01-01

With the rapid growth of known protein 3D structures in number, how to efficiently compare protein structures becomes an essential and challenging problem in computational structural biology. At present, many protein structure alignment methods have been developed. Among all these methods, flexible structure alignment methods are shown to be superior to rigid structure alignment methods in identifying structure similarities between proteins, which have gone through conformational changes. It is also found that the methods based on aligned fragment pairs (AFPs) have a special advantage over other approaches in balancing global structure similarities and local structure similarities. Accordingly, we propose a new flexible protein structure alignment method based on variable-length AFPs. Compared with other methods, the proposed method possesses three main advantages. First, it is based on variable-length AFPs. The length of each AFP is separately determined to maximally represent a local similar structure fragment, which reduces the number of AFPs. Second, it uses local coordinate systems, which simplify the computation at each step of the expansion of AFPs during the AFP identification. Third, it decreases the number of twists by rewarding the situation where nonconsecutive AFPs share the same transformation in the alignment, which is realized by dynamic programming with an improved transition function. The experimental data show that compared with FlexProt, FATCAT, and FlexSnap, the proposed method can achieve comparable results by introducing fewer twists. Meanwhile, it can generate results similar to those of the FATCAT method in much less running time due to the reduced number of AFPs.

Development of an embedded instrument for autofocus and polarization alignment of polarization maintaining fiber

NASA Astrophysics Data System (ADS)

Feng, Di; Fang, Qimeng; Huang, Huaibo; Zhao, Zhengqi; Song, Ningfang

2017-12-01

The development and implementation of a practical instrument based on an embedded technique for autofocus and polarization alignment of polarization maintaining fiber is presented. For focusing efficiency and stability, an image-based focusing algorithm fully considering the image definition evaluation and the focusing search strategy was used to accomplish autofocus. For improving the alignment accuracy, various image-based algorithms of alignment detection were developed with high calculation speed and strong robustness. The instrument can be operated as a standalone device with real-time processing and convenience operations. The hardware construction, software interface, and image-based algorithms of main modules are described. Additionally, several image simulation experiments were also carried out to analyze the accuracy of the above alignment detection algorithms. Both the simulation results and experiment results indicate that the instrument can achieve the accuracy of polarization alignment <±0.1 deg.

A Comparitive Analysis of the Influence of Weather on the Flight Altitudes of Birds.

NASA Astrophysics Data System (ADS)

Shamoun-Baranes, Judy; van Loon, Emiel; van Gasteren, Hans; van Belle, Jelmer; Bouten, Willem; Buurma, Luit

2006-01-01

Birds pose a serious risk to flight safety worldwide. A Bird Avoidance Model (BAM) is being developed in the Netherlands to reduce the risk of bird aircraft collisions. In order to develop a temporally and spatially dynamic model of bird densities, data are needed on the flight-altitude distribution of birds and how this is influenced by weather. This study focuses on the dynamics of flight altitudes of several species of birds during local flights over land in relation to meteorological conditions.We measured flight altitudes of several species in the southeastern Netherlands using tracking radar during spring and summer 2000. Representatives of different flight strategy groups included four species: a soaring species (buzzard ), an obligatory aerial forager (swift Apus apus), a flapping and gliding species (blackheaded gull Larus ridibundus), and a flapping species (starling Sturnus vulgaris).Maximum flight altitudes varied among species, during the day and among days. Weather significantly influenced the flight altitudes of all species studied. Factors such as temperature, relative humidity, atmospheric instability, cloud cover, and sea level pressure were related to flight altitudes. Different combinations of factors explained 40% 70% of the variance in maximum flight altitudes. Weather affected flight strategy groups differently. Compared to flapping species, buzzards and swifts showed stronger variations in maximum daily altitude and f lew higher under conditions reflecting stronger thermal convection. The dynamic vertical distributions of birds are important for risk assessment and mitigation measures in flight safety as well as wind turbine studies.

Coval: Improving Alignment Quality and Variant Calling Accuracy for Next-Generation Sequencing Data

PubMed Central

Kosugi, Shunichi; Natsume, Satoshi; Yoshida, Kentaro; MacLean, Daniel; Cano, Liliana; Kamoun, Sophien; Terauchi, Ryohei

2013-01-01

Accurate identification of DNA polymorphisms using next-generation sequencing technology is challenging because of a high rate of sequencing error and incorrect mapping of reads to reference genomes. Currently available short read aligners and DNA variant callers suffer from these problems. We developed the Coval software to improve the quality of short read alignments. Coval is designed to minimize the incidence of spurious alignment of short reads, by filtering mismatched reads that remained in alignments after local realignment and error correction of mismatched reads. The error correction is executed based on the base quality and allele frequency at the non-reference positions for an individual or pooled sample. We demonstrated the utility of Coval by applying it to simulated genomes and experimentally obtained short-read data of rice, nematode, and mouse. Moreover, we found an unexpectedly large number of incorrectly mapped reads in ‘targeted’ alignments, where the whole genome sequencing reads had been aligned to a local genomic segment, and showed that Coval effectively eliminated such spurious alignments. We conclude that Coval significantly improves the quality of short-read sequence alignments, thereby increasing the calling accuracy of currently available tools for SNP and indel identification. Coval is available at http://sourceforge.net/projects/coval105/. PMID:24116042

HSA: a heuristic splice alignment tool.

PubMed

Bu, Jingde; Chi, Xuebin; Jin, Zhong

2013-01-01

RNA-Seq methodology is a revolutionary transcriptomics sequencing technology, which is the representative of Next generation Sequencing (NGS). With the high throughput sequencing of RNA-Seq, we can acquire much more information like differential expression and novel splice variants from deep sequence analysis and data mining. But the short read length brings a great challenge to alignment, especially when the reads span two or more exons. A two steps heuristic splice alignment tool is generated in this investigation. First, map raw reads to reference with unspliced aligner--BWA; second, split initial unmapped reads into three equal short reads (seeds), align each seed to the reference, filter hits, search possible split position of read and extend hits to a complete match. Compare with other splice alignment tools like SOAPsplice and Tophat2, HSA has a better performance in call rate and efficiency, but its results do not as accurate as the other software to some extent. HSA is an effective spliced aligner of RNA-Seq reads mapping, which is available at https://github.com/vlcc/HSA.

The Search for Astronomical Alignments in the Seventh Century A.D. Silla Capital at Kyongju, Korea

NASA Astrophysics Data System (ADS)

Nelson, S. M.; Stencel, R. E.

1999-05-01

In the center of the modern Korean city of Kyongju stands a modest structure dating from the 7th century AD, known as Chomsongdae, or the Star Observatory. Known locally as the oldest observatory in Asia, details of its precise use are lost, but its construction coincided with the height of Silla culture and its dominance over the Korean peninsula. Radially from the structure are located the so-called Moon Fortress, numerous large tombsites for elite of the culture, plus hillside fortresses and elaborate Buddhist temples. During 1999, we've conducted a course at Denver as part of our Core Curriculum program for The Women's College, that has examined the astronomical and cultural aspects of the Kyongju site, to attempt to determine whether the architects may have included astronomical alignments into the ``Feng Shui" of their city planning, spanning centuries. The preliminary result of our studies suggests that east and west of Star Observatory lay fortress and wall features that may have been useful for equinox determination. A discussion of ethnographic supporting evidence will be provided, but additional on-site observations will be needed to confirm the idea.

DNA sequence alignment by microhomology sampling during homologous recombination

PubMed Central

Qi, Zhi; Redding, Sy; Lee, Ja Yil; Gibb, Bryan; Kwon, YoungHo; Niu, Hengyao; Gaines, William A.; Sung, Patrick

2015-01-01

Summary Homologous recombination (HR) mediates the exchange of genetic information between sister or homologous chromatids. During HR, members of the RecA/Rad51 family of recombinases must somehow search through vast quantities of DNA sequence to align and pair ssDNA with a homologous dsDNA template. Here we use single-molecule imaging to visualize Rad51 as it aligns and pairs homologous DNA sequences in real-time. We show that Rad51 uses a length-based recognition mechanism while interrogating dsDNA, enabling robust kinetic selection of 8-nucleotide (nt) tracts of microhomology, which kinetically confines the search to sites with a high probability of being a homologous target. Successful pairing with a 9th nucleotide coincides with an additional reduction in binding free energy and subsequent strand exchange occurs in precise 3-nt steps, reflecting the base triplet organization of the presynaptic complex. These findings provide crucial new insights into the physical and evolutionary underpinnings of DNA recombination. PMID:25684365

ExoLocator--an online view into genetic makeup of vertebrate proteins.

PubMed

Khoo, Aik Aun; Ogrizek-Tomas, Mario; Bulovic, Ana; Korpar, Matija; Gürler, Ece; Slijepcevic, Ivan; Šikic, Mile; Mihalek, Ivana

2014-01-01

ExoLocator (http://exolocator.eopsf.org) collects in a single place information needed for comparative analysis of protein-coding exons from vertebrate species. The main source of data--the genomic sequences, and the existing exon and homology annotation--is the ENSEMBL database of completed vertebrate genomes. To these, ExoLocator adds the search for ostensibly missing exons in orthologous protein pairs across species, using an extensive computational pipeline to narrow down the search region for the candidate exons and find a suitable template in the other species, as well as state-of-the-art implementations of pairwise alignment algorithms. The resulting complements of exons are organized in a way currently unique to ExoLocator: multiple sequence alignments, both on the nucleotide and on the peptide levels, clearly indicating the exon boundaries. The alignments can be inspected in the web-embedded viewer, downloaded or used on the spot to produce an estimate of conservation within orthologous sets, or functional divergence across paralogues.

DNA motif alignment by evolving a population of Markov chains.

PubMed

Bi, Chengpeng

2009-01-30

Deciphering cis-regulatory elements or de novo motif-finding in genomes still remains elusive although much algorithmic effort has been expended. The Markov chain Monte Carlo (MCMC) method such as Gibbs motif samplers has been widely employed to solve the de novo motif-finding problem through sequence local alignment. Nonetheless, the MCMC-based motif samplers still suffer from local maxima like EM. Therefore, as a prerequisite for finding good local alignments, these motif algorithms are often independently run a multitude of times, but without information exchange between different chains. Hence it would be worth a new algorithm design enabling such information exchange. This paper presents a novel motif-finding algorithm by evolving a population of Markov chains with information exchange (PMC), each of which is initialized as a random alignment and run by the Metropolis-Hastings sampler (MHS). It is progressively updated through a series of local alignments stochastically sampled. Explicitly, the PMC motif algorithm performs stochastic sampling as specified by a population-based proposal distribution rather than individual ones, and adaptively evolves the population as a whole towards a global maximum. The alignment information exchange is accomplished by taking advantage of the pooled motif site distributions. A distinct method for running multiple independent Markov chains (IMC) without information exchange, or dubbed as the IMC motif algorithm, is also devised to compare with its PMC counterpart. Experimental studies demonstrate that the performance could be improved if pooled information were used to run a population of motif samplers. The new PMC algorithm was able to improve the convergence and outperformed other popular algorithms tested using simulated and biological motif sequences.

Aligning Metabolic Pathways Exploiting Binary Relation of Reactions.

PubMed

Huang, Yiran; Zhong, Cheng; Lin, Hai Xiang; Huang, Jing

2016-01-01

Metabolic pathway alignment has been widely used to find one-to-one and/or one-to-many reaction mappings to identify the alternative pathways that have similar functions through different sets of reactions, which has important applications in reconstructing phylogeny and understanding metabolic functions. The existing alignment methods exhaustively search reaction sets, which may become infeasible for large pathways. To address this problem, we present an effective alignment method for accurately extracting reaction mappings between two metabolic pathways. We show that connected relation between reactions can be formalized as binary relation of reactions in metabolic pathways, and the multiplications of zero-one matrices for binary relations of reactions can be accomplished in finite steps. By utilizing the multiplications of zero-one matrices for binary relation of reactions, we efficiently obtain reaction sets in a small number of steps without exhaustive search, and accurately uncover biologically relevant reaction mappings. Furthermore, we introduce a measure of topological similarity of nodes (reactions) by comparing the structural similarity of the k-neighborhood subgraphs of the nodes in aligning metabolic pathways. We employ this similarity metric to improve the accuracy of the alignments. The experimental results on the KEGG database show that when compared with other state-of-the-art methods, in most cases, our method obtains better performance in the node correctness and edge correctness, and the number of the edges of the largest common connected subgraph for one-to-one reaction mappings, and the number of correct one-to-many reaction mappings. Our method is scalable in finding more reaction mappings with better biological relevance in large metabolic pathways.

Biclustering as a method for RNA local multiple sequence alignment.

PubMed

Wang, Shu; Gutell, Robin R; Miranker, Daniel P

2007-12-15

Biclustering is a clustering method that simultaneously clusters both the domain and range of a relation. A challenge in multiple sequence alignment (MSA) is that the alignment of sequences is often intended to reveal groups of conserved functional subsequences. Simultaneously, the grouping of the sequences can impact the alignment; precisely the kind of dual situation biclustering is intended to address. We define a representation of the MSA problem enabling the application of biclustering algorithms. We develop a computer program for local MSA, BlockMSA, that combines biclustering with divide-and-conquer. BlockMSA simultaneously finds groups of similar sequences and locally aligns subsequences within them. Further alignment is accomplished by dividing both the set of sequences and their contents. The net result is both a multiple sequence alignment and a hierarchical clustering of the sequences. BlockMSA was tested on the subsets of the BRAliBase 2.1 benchmark suite that display high variability and on an extension to that suite to larger problem sizes. Also, alignments were evaluated of two large datasets of current biological interest, T box sequences and Group IC1 Introns. The results were compared with alignments computed by ClustalW, MAFFT, MUCLE and PROBCONS alignment programs using Sum of Pairs (SPS) and Consensus Count. Results for the benchmark suite are sensitive to problem size. On problems of 15 or greater sequences, BlockMSA is consistently the best. On none of the problems in the test suite are there appreciable differences in scores among BlockMSA, MAFFT and PROBCONS. On the T box sequences, BlockMSA does the most faithful job of reproducing known annotations. MAFFT and PROBCONS do not. On the Intron sequences, BlockMSA, MAFFT and MUSCLE are comparable at identifying conserved regions. BlockMSA is implemented in Java. Source code and supplementary datasets are available at http://aug.csres.utexas.edu/msa/

Inside Man

ERIC Educational Resources Information Center

Riofrio, Richard

2008-01-01

The author was on the academic job market in English eight years in a row. The first four times, he applied all over the place, searching for his first tenure-track job. The next four times, he applied selectively, searching for a position more closely aligned with his academic and personal interests. Although each year on the market was…

Coordinate alignment of combined measurement systems using a modified common points method

NASA Astrophysics Data System (ADS)

Zhao, G.; Zhang, P.; Xiao, W.

2018-03-01

The co-ordinate metrology has been extensively researched for its outstanding advantages in measurement range and accuracy. The alignment of different measurement systems is usually achieved by integrating local coordinates via common points before measurement. The alignment errors would accumulate and significantly reduce the global accuracy, thus need to be minimized. In this thesis, a modified common points method (MCPM) is proposed to combine different traceable system errors of the cooperating machines, and optimize the global accuracy by introducing mutual geometric constraints. The geometric constraints, obtained by measuring the common points in individual local coordinate systems, provide the possibility to reduce the local measuring uncertainty whereby enhance the global measuring certainty. A simulation system is developed in Matlab to analyze the feature of MCPM using the Monto-Carlo method. An exemplary setup is constructed to verify the feasibility and efficiency of the proposed method associated with laser tracker and indoor iGPS systems. Experimental results show that MCPM could significantly improve the alignment accuracy.

SPIN ALIGNMENTS OF SPIRAL GALAXIES WITHIN THE LARGE-SCALE STRUCTURE FROM SDSS DR7

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Youcai; Yang, Xiaohu; Luo, Wentao

Using a sample of spiral galaxies selected from the Sloan Digital Sky Survey Data Release 7 and Galaxy Zoo 2, we investigate the alignment of spin axes of spiral galaxies with their surrounding large-scale structure, which is characterized by the large-scale tidal field reconstructed from the data using galaxy groups above a certain mass threshold. We find that the spin axes only have weak tendencies to be aligned with (or perpendicular to) the intermediate (or minor) axis of the local tidal tensor. The signal is the strongest in a cluster environment where all three eigenvalues of the local tidal tensor aremore » positive. Compared to the alignments between halo spins and the local tidal field obtained in N-body simulations, the above observational results are in best agreement with those for the spins of inner regions of halos, suggesting that the disk material traces the angular momentum of dark matter halos in the inner regions.« less

Polarization-dependent DANES study on vertically-aligned ZnO nanorods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sun, Chengjun; Park, Chang-In; Jin, Zhenlan

2016-05-01

The local structural and local density of states of vertically-aligned ZnO nanorods were examined by using a polarization-dependent diffraction anomalous near edge structure (DANES) measurements from c-oriented ZnO nanorods at the Zn K edge with the incident x-ray electric field parallel and perpendicular to the x-ray momentum transfer direction. Orientation-dependent local structures determined by DANES were comparable with polarization-dependent EXAFS results. Unlike other techniques, polarization-dependent DANES can uniquely describe the orientation-dependent local structural properties and the local density of states of a selected element in selected-phased crystals of compounds or mixed-phased structures.

Cloning and expression of N-glycosylation-related glucosidase from Glaciozyma antarctica

NASA Astrophysics Data System (ADS)

Yajit, Noor Liana Mat; Kamaruddin, Shazilah; Hashim, Noor Haza Fazlin; Bakar, Farah Diba Abu; Murad, Abd. Munir Abd.; Mahadi, Nor Muhammad; Mackeen, Mukram Mohamed

2016-11-01

The need for functional oligosaccharides in various field is ever growing. The enzymatic approach for synthesis of oligosaccharides is advantageous over traditional chemical synthesis because of the regio- and stereo- selectivity that can be achieved without the need for protection chemistry. In this study, the α-glucosidase I protein sequence from Saccharomyces cerevisiae (UniProt database) was compared using Basic Local Alignment Search Tool (BLAST) with Glaciozyma antarctica genome database. Results showed 33% identity and an E-value of 1 × 10-125 for α-glucosidase I. The gene was amplified, cloned into the pPICZα C vector and used to transform Pichia pastoris X-33 cells. Soluble expression of α-Glucosidase I (˜91 kDa) was achieved at 28 °C with 1.0 % of methanol.

When Gravity Fails: Local Search Topology

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Cheeseman, Peter; Stutz, John; Lau, Sonie (Technical Monitor)

1997-01-01

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\\em plateau moves), dominate the time spent in local search. We analyze and characterize {\\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Memetic algorithms for de novo motif-finding in biomedical sequences.

PubMed

Bi, Chengpeng

2012-09-01

The objectives of this study are to design and implement a new memetic algorithm for de novo motif discovery, which is then applied to detect important signals hidden in various biomedical molecular sequences. In this paper, memetic algorithms are developed and tested in de novo motif-finding problems. Several strategies in the algorithm design are employed that are to not only efficiently explore the multiple sequence local alignment space, but also effectively uncover the molecular signals. As a result, there are a number of key features in the implementation of the memetic motif-finding algorithm (MaMotif), including a chromosome replacement operator, a chromosome alteration-aware local search operator, a truncated local search strategy, and a stochastic operation of local search imposed on individual learning. To test the new algorithm, we compare MaMotif with a few of other similar algorithms using simulated and experimental data including genomic DNA, primary microRNA sequences (let-7 family), and transmembrane protein sequences. The new memetic motif-finding algorithm is successfully implemented in C++, and exhaustively tested with various simulated and real biological sequences. In the simulation, it shows that MaMotif is the most time-efficient algorithm compared with others, that is, it runs 2 times faster than the expectation maximization (EM) method and 16 times faster than the genetic algorithm-based EM hybrid. In both simulated and experimental testing, results show that the new algorithm is compared favorably or superior to other algorithms. Notably, MaMotif is able to successfully discover the transcription factors' binding sites in the chromatin immunoprecipitation followed by massively parallel sequencing (ChIP-Seq) data, correctly uncover the RNA splicing signals in gene expression, and precisely find the highly conserved helix motif in the transmembrane protein sequences, as well as rightly detect the palindromic segments in the primary microRNA sequences. The memetic motif-finding algorithm is effectively designed and implemented, and its applications demonstrate it is not only time-efficient, but also exhibits excellent performance while compared with other popular algorithms. Copyright © 2012 Elsevier B.V. All rights reserved.

Local-global alignment for finding 3D similarities in protein structures

DOEpatents

Zemla, Adam T [Brentwood, CA

2011-09-20

A method of finding 3D similarities in protein structures of a first molecule and a second molecule. The method comprises providing preselected information regarding the first molecule and the second molecule. Comparing the first molecule and the second molecule using Longest Continuous Segments (LCS) analysis. Comparing the first molecule and the second molecule using Global Distance Test (GDT) analysis. Comparing the first molecule and the second molecule using Local Global Alignment Scoring function (LGA_S) analysis. Verifying constructed alignment and repeating the steps to find the regions of 3D similarities in protein structures.

Localization of ultra-low frequency waves in multi-ion plasmas of the planetary magnetosphere

DOE PAGES

Kim, Eun -Hwa; Johnson, Jay R.; Lee, Dong -Hun

2015-01-01

By adopting a 2D time-dependent wave code, we investigate how mode-converted waves at the Ion-Ion Hybrid (IIH) resonance and compressional waves propagate in 2D density structures with a wide range of field-aligned wavenumbers to background magnetic fields. The simulation results show that the mode-converted waves have continuous bands across the field line consistent with previous numerical studies. These waves also have harmonic structures in frequency domain and are localized in the field-aligned heavy ion density well. Lastly, our results thus emphasize the importance of a field-aligned heavy ion density structure for ultra-low frequency wave propagation, and suggest that IIH wavesmore » can be localized in different locations along the field line.« less

Cascaded face alignment via intimacy definition feature

NASA Astrophysics Data System (ADS)

Li, Hailiang; Lam, Kin-Man; Chiu, Man-Yau; Wu, Kangheng; Lei, Zhibin

2017-09-01

Recent years have witnessed the emerging popularity of regression-based face aligners, which directly learn mappings between facial appearance and shape-increment manifolds. We propose a random-forest based, cascaded regression model for face alignment by using a locally lightweight feature, namely intimacy definition feature. This feature is more discriminative than the pose-indexed feature, more efficient than the histogram of oriented gradients feature and the scale-invariant feature transform feature, and more compact than the local binary feature (LBF). Experimental validation of our algorithm shows that our approach achieves state-of-the-art performance when testing on some challenging datasets. Compared with the LBF-based algorithm, our method achieves about twice the speed, 20% improvement in terms of alignment accuracy and saves an order of magnitude on memory requirement.

Accountability and Alignment under No Child Left Behind: Multi-Level Perspectives for Educational Leaders

ERIC Educational Resources Information Center

Choi, Daniel

2011-01-01

Educational leaders have faced the challenges of trying to align schoolwide reforms priorities with accountability demands under the No Child Left Behind law. This article examines the barriers that complicate meaningful alignment among federal, state and local levels. This article also offers the following recommendations: Schools and districts…

Dali server update.

PubMed

Holm, Liisa; Laakso, Laura M

2016-07-08

The Dali server (http://ekhidna2.biocenter.helsinki.fi/dali) is a network service for comparing protein structures in 3D. In favourable cases, comparing 3D structures may reveal biologically interesting similarities that are not detectable by comparing sequences. The Dali server has been running in various places for over 20 years and is used routinely by crystallographers on newly solved structures. The latest update of the server provides enhanced analytics for the study of sequence and structure conservation. The server performs three types of structure comparisons: (i) Protein Data Bank (PDB) search compares one query structure against those in the PDB and returns a list of similar structures; (ii) pairwise comparison compares one query structure against a list of structures specified by the user; and (iii) all against all structure comparison returns a structural similarity matrix, a dendrogram and a multidimensional scaling projection of a set of structures specified by the user. Structural superimpositions are visualized using the Java-free WebGL viewer PV. The structural alignment view is enhanced by sequence similarity searches against Uniprot. The combined structure-sequence alignment information is compressed to a stack of aligned sequence logos. In the stack, each structure is structurally aligned to the query protein and represented by a sequence logo. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

Hot Jupiters Aren't As Lonely As We Thought

NASA Astrophysics Data System (ADS)

Kohler, Susanna

2016-01-01

The Friends of Hot Jupiters (FOHJ) project is a systematic search for planetary- and stellar-mass companions in systems that have known hot Jupiters short-period, gas-giant planets. This survey has discovered that many more hot Jupiters may have companions than originally believed.Missing FriendsFOHJ was begun with the goal of better understanding the systems that host hot Jupiters, in order to settle several longstanding issues.The first problem was one of observational statistics. We know that roughly half of the Sun-like stars nearby are in binary systems, yet weve only discovered a handful of hot Jupiters around binaries. Are binary systems less likely to host hot Jupiters? Or have we just missed the binary companions in the hot-Jupiter-hosting systems weve seen so far?An additional issue relates to formation mechanisms. Hot Jupiters probably migrated inward from where they formed out beyond the ice lines in protoplanetary disks but how?This median-stacked image, obtained with adaptive optics, shows one of the newly-discovered stellar companions to a star hosting a hot Jupiter. The projected separation is ~180 AU. [Ngo et al. 2015]Observations reveal two populations of hot Jupiters: those with circular orbits aligned with their hosts spins, and those with eccentric, misaligned orbits. The former population support a migration model dominated by local planet-disk interactions, whereas the latter population suggest the hot Jupiters migrated through dynamical interactions with distant companions. A careful determination of the companion rate in hot-Jupiter-hosting systems could help establish the ability of these two models to explain the observed populations.Search for CompanionsThe FOHJ project began in 2012 and studied 51 systems hosting known, transiting hot Jupiters with roughly half on circular, aligned orbits and half on eccentric, misaligned orbits. The survey consisted of three different, complementary components:Study 1Lead author: Heather Knutson (Caltech)Technique: Long-term radial velocity monitoringSearching for: Planetary companions at 120 AU from the starStudy 2Lead author: Henry Ngo (Caltech)Technique: Adaptive-optics imagingSearching for: Stellar companions at 502000 AU from the starStudy 3Lead author: Danielle Piskorz (Caltech)Technique: SpectroscopySearching for: Any additional stellar companions at 125 AU from the starThe companion fraction found within Study 2, the adaptive-optics imagine search. The three curves show the total, the systems with hot Jupiters on aligned and circular orbits, and those with hot Jupiters on misaligned and eccentric orbits. [Ngo et al. 2015]Migration ImplicationsUsing these three different techniques, the team found a significant number of both planetary and stellar companions that had not been previously detected. After correcting their results for completeness, they found a multiple-star rate of ~50% for these systems, resolving the problem of the missing companions. So really, we just werent looking hard enough for the companions previously.Intriguingly, the binary companion rate found for these hot Jupiter systems is higher than the average rate for the field stars (which is below 25% for the semimajor-axis range the FOHJ studies are sensitive to). This suggests that companion stars may indeed play a role in hot Jupiter formation and migration.That said, none of the three studies found a significant difference in the binary fraction for aligned versus misaligned hot Jupiters which means that the answer is not as simple as thought, with companion stars causing the misaligned planets. Thus, while hot Jupiters friends may play a role in their formation and migration, we still have work to do in understanding what that role is.CitationDanielle Piskorz et al 2015 ApJ 814 148. doi:10.1088/0004-637X/814/2/148Henry Ngo et al 2015 ApJ 800 138. doi:10.1088/0004-637X/800/2/138Heather A. Knutson et al 2014 ApJ 785 126. doi:10.1088/0004-637X/785/2/126

Using structural knowledge in the protein data bank to inform the search for potential host-microbe protein interactions in sequence space: application to Mycobacterium tuberculosis.

PubMed

Mahajan, Gaurang; Mande, Shekhar C

2017-04-04

A comprehensive map of the human-M. tuberculosis (MTB) protein interactome would help fill the gaps in our understanding of the disease, and computational prediction can aid and complement experimental studies towards this end. Several sequence-based in silico approaches tap the existing data on experimentally validated protein-protein interactions (PPIs); these PPIs serve as templates from which novel interactions between pathogen and host are inferred. Such comparative approaches typically make use of local sequence alignment, which, in the absence of structural details about the interfaces mediating the template interactions, could lead to incorrect inferences, particularly when multi-domain proteins are involved. We propose leveraging the domain-domain interaction (DDI) information in PDB complexes to score and prioritize candidate PPIs between host and pathogen proteomes based on targeted sequence-level comparisons. Our method picks out a small set of human-MTB protein pairs as candidates for physical interactions, and the use of functional meta-data suggests that some of them could contribute to the in vivo molecular cross-talk between pathogen and host that regulates the course of the infection. Further, we present numerical data for Pfam domain families that highlights interaction specificity on the domain level. Not every instance of a pair of domains, for which interaction evidence has been found in a few instances (i.e. structures), is likely to functionally interact. Our sorting approach scores candidates according to how "distant" they are in sequence space from known examples of DDIs (templates). Thus, it provides a natural way to deal with the heterogeneity in domain-level interactions. Our method represents a more informed application of local alignment to the sequence-based search for potential human-microbial interactions that uses available PPI data as a prior. Our approach is somewhat limited in its sensitivity by the restricted size and diversity of the template dataset, but, given the rapid accumulation of solved protein complex structures, its scope and utility are expected to keep steadily improving.

Algebraic Algorithm Design and Local Search

DTIC Science & Technology

1996-12-01

method for performing algorithm design that is more purely algebraic than that of KIDS. This method is then applied to local search. Local search is a...synthesis. Our approach was to follow KIDS in spirit, but to adopt a pure algebraic formalism, supported by Kestrel’s SPECWARE environment (79), that...design was developed that is more purely algebraic than that of KIDS. This method was then applied to local search. A general theory of local search was

Image correlation method for DNA sequence alignment.

PubMed

Curilem Saldías, Millaray; Villarroel Sassarini, Felipe; Muñoz Poblete, Carlos; Vargas Vásquez, Asticio; Maureira Butler, Iván

2012-01-01

The complexity of searches and the volume of genomic data make sequence alignment one of bioinformatics most active research areas. New alignment approaches have incorporated digital signal processing techniques. Among these, correlation methods are highly sensitive. This paper proposes a novel sequence alignment method based on 2-dimensional images, where each nucleic acid base is represented as a fixed gray intensity pixel. Query and known database sequences are coded to their pixel representation and sequence alignment is handled as object recognition in a scene problem. Query and database become object and scene, respectively. An image correlation process is carried out in order to search for the best match between them. Given that this procedure can be implemented in an optical correlator, the correlation could eventually be accomplished at light speed. This paper shows an initial research stage where results were "digitally" obtained by simulating an optical correlation of DNA sequences represented as images. A total of 303 queries (variable lengths from 50 to 4500 base pairs) and 100 scenes represented by 100 x 100 images each (in total, one million base pair database) were considered for the image correlation analysis. The results showed that correlations reached very high sensitivity (99.01%), specificity (98.99%) and outperformed BLAST when mutation numbers increased. However, digital correlation processes were hundred times slower than BLAST. We are currently starting an initiative to evaluate the correlation speed process of a real experimental optical correlator. By doing this, we expect to fully exploit optical correlation light properties. As the optical correlator works jointly with the computer, digital algorithms should also be optimized. The results presented in this paper are encouraging and support the study of image correlation methods on sequence alignment.

Rapid protein alignment in the cloud: HAMOND combines fast DIAMOND alignments with Hadoop parallelism.

PubMed

Yu, Jia; Blom, Jochen; Sczyrba, Alexander; Goesmann, Alexander

2017-09-10

The introduction of next generation sequencing has caused a steady increase in the amounts of data that have to be processed in modern life science. Sequence alignment plays a key role in the analysis of sequencing data e.g. within whole genome sequencing or metagenome projects. BLAST is a commonly used alignment tool that was the standard approach for more than two decades, but in the last years faster alternatives have been proposed including RapSearch, GHOSTX, and DIAMOND. Here we introduce HAMOND, an application that uses Apache Hadoop to parallelize DIAMOND computation in order to scale-out the calculation of alignments. HAMOND is fault tolerant and scalable by utilizing large cloud computing infrastructures like Amazon Web Services. HAMOND has been tested in comparative genomics analyses and showed promising results both in efficiency and accuracy. Copyright © 2017 The Author(s). Published by Elsevier B.V. All rights reserved.

Iterative Most-Likely Point Registration (IMLP): A Robust Algorithm for Computing Optimal Shape Alignment

PubMed Central

Billings, Seth D.; Boctor, Emad M.; Taylor, Russell H.

2015-01-01

We present a probabilistic registration algorithm that robustly solves the problem of rigid-body alignment between two shapes with high accuracy, by aptly modeling measurement noise in each shape, whether isotropic or anisotropic. For point-cloud shapes, the probabilistic framework additionally enables modeling locally-linear surface regions in the vicinity of each point to further improve registration accuracy. The proposed Iterative Most-Likely Point (IMLP) algorithm is formed as a variant of the popular Iterative Closest Point (ICP) algorithm, which iterates between point-correspondence and point-registration steps. IMLP’s probabilistic framework is used to incorporate a generalized noise model into both the correspondence and the registration phases of the algorithm, hence its name as a most-likely point method rather than a closest-point method. To efficiently compute the most-likely correspondences, we devise a novel search strategy based on a principal direction (PD)-tree search. We also propose a new approach to solve the generalized total-least-squares (GTLS) sub-problem of the registration phase, wherein the point correspondences are registered under a generalized noise model. Our GTLS approach has improved accuracy, efficiency, and stability compared to prior methods presented for this problem and offers a straightforward implementation using standard least squares. We evaluate the performance of IMLP relative to a large number of prior algorithms including ICP, a robust variant on ICP, Generalized ICP (GICP), and Coherent Point Drift (CPD), as well as drawing close comparison with the prior anisotropic registration methods of GTLS-ICP and A-ICP. The performance of IMLP is shown to be superior with respect to these algorithms over a wide range of noise conditions, outliers, and misalignments using both mesh and point-cloud representations of various shapes. PMID:25748700

Extreme Magneto-transport of Bulk Carbon Nanotubes in Sorted Electronic Concentrations and Aligned High Performance Fiber

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bulmer, John S.; Lekawa-Raus, Agnieszka; Rickel, Dwight G.

We explored high-field (60 T) magneto-resistance (MR) with two carbon nanotube (CNT) material classes: (1) unaligned single-wall CNTs (SWCNT) films with controlled metallic SWCNT concentrations and doping degree and (2) CNT fiber with aligned, long-length microstructure. All unaligned SWCNT films showed localized hopping transport where high-field MR saturation definitively supports spin polarization instead of a more prevalent wave function shrinking mechanism. Nitric acid exposure induced an insulator to metal transition and reduced the positive MR component. Aligned CNT fiber, already on the metal side of the insulator to metal transition, had positive MR without saturation and was assigned to classicalmore » MR involving electronic mobility. Subtracting high-field fits from the aligned fiber’s MR yielded an unconfounded negative MR, which was assigned to weak localization. It is concluded that fluctuation induced tunnelling, an extrinsic transport model accounting for most of the aligned fiber’s room temperature resistance, appears to lack MR field dependence.« less

Pre-calculated protein structure alignments at the RCSB PDB website.

PubMed

Prlic, Andreas; Bliven, Spencer; Rose, Peter W; Bluhm, Wolfgang F; Bizon, Chris; Godzik, Adam; Bourne, Philip E

2010-12-01

With the continuous growth of the RCSB Protein Data Bank (PDB), providing an up-to-date systematic structure comparison of all protein structures poses an ever growing challenge. Here, we present a comparison tool for calculating both 1D protein sequence and 3D protein structure alignments. This tool supports various applications at the RCSB PDB website. First, a structure alignment web service calculates pairwise alignments. Second, a stand-alone application runs alignments locally and visualizes the results. Third, pre-calculated 3D structure comparisons for the whole PDB are provided and updated on a weekly basis. These three applications allow users to discover novel relationships between proteins available either at the RCSB PDB or provided by the user. A web user interface is available at http://www.rcsb.org/pdb/workbench/workbench.do. The source code is available under the LGPL license from http://www.biojava.org. A source bundle, prepared for local execution, is available from http://source.rcsb.org andreas@sdsc.edu; pbourne@ucsd.edu.

Extreme Magneto-transport of Bulk Carbon Nanotubes in Sorted Electronic Concentrations and Aligned High Performance Fiber.

PubMed

Bulmer, John S; Lekawa-Raus, Agnieszka; Rickel, Dwight G; Balakirev, Fedor F; Koziol, Krzysztof K

2017-09-22

We explored high-field (60 T) magneto-resistance (MR) with two carbon nanotube (CNT) material classes: (1) unaligned single-wall CNTs (SWCNT) films with controlled metallic SWCNT concentrations and doping degree and (2) CNT fiber with aligned, long-length microstructure. All unaligned SWCNT films showed localized hopping transport where high-field MR saturation definitively supports spin polarization instead of a more prevalent wave function shrinking mechanism. Nitric acid exposure induced an insulator to metal transition and reduced the positive MR component. Aligned CNT fiber, already on the metal side of the insulator to metal transition, had positive MR without saturation and was assigned to classical MR involving electronic mobility. Subtracting high-field fits from the aligned fiber's MR yielded an unconfounded negative MR, which was assigned to weak localization. It is concluded that fluctuation induced tunnelling, an extrinsic transport model accounting for most of the aligned fiber's room temperature resistance, appears to lack MR field dependence.

Extreme Magneto-transport of Bulk Carbon Nanotubes in Sorted Electronic Concentrations and Aligned High Performance Fiber

DOE PAGES

Bulmer, John S.; Lekawa-Raus, Agnieszka; Rickel, Dwight G.; ...

2017-09-22

We explored high-field (60 T) magneto-resistance (MR) with two carbon nanotube (CNT) material classes: (1) unaligned single-wall CNTs (SWCNT) films with controlled metallic SWCNT concentrations and doping degree and (2) CNT fiber with aligned, long-length microstructure. All unaligned SWCNT films showed localized hopping transport where high-field MR saturation definitively supports spin polarization instead of a more prevalent wave function shrinking mechanism. Nitric acid exposure induced an insulator to metal transition and reduced the positive MR component. Aligned CNT fiber, already on the metal side of the insulator to metal transition, had positive MR without saturation and was assigned to classicalmore » MR involving electronic mobility. Subtracting high-field fits from the aligned fiber’s MR yielded an unconfounded negative MR, which was assigned to weak localization. It is concluded that fluctuation induced tunnelling, an extrinsic transport model accounting for most of the aligned fiber’s room temperature resistance, appears to lack MR field dependence.« less

CO-ORBITING PLANES OF SUB-HALOS ARE SIMILARLY UNLIKELY AROUND PAIRED AND ISOLATED HOSTS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pawlowski, Marcel S.; McGaugh, Stacy S., E-mail: marcel.pawlowski@case.edu

2014-07-01

Sub-halos in dark-matter-based cosmological simulations tend to be distributed approximately isotropically around their host. The existence of highly flattened, co-orbiting planes of satellite galaxies has therefore been identified as a possible problem for these cosmological models, but so far studies have not considered the hosts' environments. That satellite planes are now known around both major galaxies in the Local Group raises the question whether they are more likely to be found around paired hosts. In a first attempt to investigate this possibility, we focus on the flattening and orbital coherence of the 11 brightest satellite galaxies of the vast polarmore » structure (VPOS) around the Milky Way (MW). We search for VPOS analogs in the ''Exploring the Local Volume in Simulations'' suite of cosmological simulations, which consist of 24 paired and 24 isolated host halos. We do not find significant differences between the properties of sub-halo distributions around paired and isolated hosts. The observed flattening and the observed orbital alignment are each reproduced by only 0.2%-2% of paired and isolated systems incorporating the obscuration of satellites by randomly oriented galactic disks. Only 1 of all 4800 analyzed realizations (0.02%) reproduces both parameters simultaneously, but the average orbital pole of this sub-halo system does not align as well with the normal to the plane fit as observed. That the MW is part of a galaxy pair thus does not help to explain the existence of the VPOS if the satellite galaxies are identified with sub-halos found in dissipationless simulations.« less

Plant Genome Resources at the National Center for Biotechnology Information

PubMed Central

Wheeler, David L.; Smith-White, Brian; Chetvernin, Vyacheslav; Resenchuk, Sergei; Dombrowski, Susan M.; Pechous, Steven W.; Tatusova, Tatiana; Ostell, James

2005-01-01

The National Center for Biotechnology Information (NCBI) integrates data from more than 20 biological databases through a flexible search and retrieval system called Entrez. A core Entrez database, Entrez Nucleotide, includes GenBank and is tightly linked to the NCBI Taxonomy database, the Entrez Protein database, and the scientific literature in PubMed. A suite of more specialized databases for genomes, genes, gene families, gene expression, gene variation, and protein domains dovetails with the core databases to make Entrez a powerful system for genomic research. Linked to the full range of Entrez databases is the NCBI Map Viewer, which displays aligned genetic, physical, and sequence maps for eukaryotic genomes including those of many plants. A specialized plant query page allow maps from all plant genomes covered by the Map Viewer to be searched in tandem to produce a display of aligned maps from several species. PlantBLAST searches against the sequences shown in the Map Viewer allow BLAST alignments to be viewed within a genomic context. In addition, precomputed sequence similarities, such as those for proteins offered by BLAST Link, enable fluid navigation from unannotated to annotated sequences, quickening the pace of discovery. NCBI Web pages for plants, such as Plant Genome Central, complete the system by providing centralized access to NCBI's genomic resources as well as links to organism-specific Web pages beyond NCBI. PMID:16010002

Simultaneous phylogeny reconstruction and multiple sequence alignment

PubMed Central

Yue, Feng; Shi, Jian; Tang, Jijun

2009-01-01

Background A phylogeny is the evolutionary history of a group of organisms. To date, sequence data is still the most used data type for phylogenetic reconstruction. Before any sequences can be used for phylogeny reconstruction, they must be aligned, and the quality of the multiple sequence alignment has been shown to affect the quality of the inferred phylogeny. At the same time, all the current multiple sequence alignment programs use a guide tree to produce the alignment and experiments showed that good guide trees can significantly improve the multiple alignment quality. Results We devise a new algorithm to simultaneously align multiple sequences and search for the phylogenetic tree that leads to the best alignment. We also implemented the algorithm as a C program package, which can handle both DNA and protein data and can take simple cost model as well as complex substitution matrices, such as PAM250 or BLOSUM62. The performance of the new method are compared with those from other popular multiple sequence alignment tools, including the widely used programs such as ClustalW and T-Coffee. Experimental results suggest that this method has good performance in terms of both phylogeny accuracy and alignment quality. Conclusion We present an algorithm to align multiple sequences and reconstruct the phylogenies that minimize the alignment score, which is based on an efficient algorithm to solve the median problems for three sequences. Our extensive experiments suggest that this method is very promising and can produce high quality phylogenies and alignments. PMID:19208110

New powerful statistics for alignment-free sequence comparison under a pattern transfer model.

PubMed

Liu, Xuemei; Wan, Lin; Li, Jing; Reinert, Gesine; Waterman, Michael S; Sun, Fengzhu

2011-09-07

Alignment-free sequence comparison is widely used for comparing gene regulatory regions and for identifying horizontally transferred genes. Recent studies on the power of a widely used alignment-free comparison statistic D2 and its variants D*2 and D(s)2 showed that their power approximates a limit smaller than 1 as the sequence length tends to infinity under a pattern transfer model. We develop new alignment-free statistics based on D2, D*2 and D(s)2 by comparing local sequence pairs and then summing over all the local sequence pairs of certain length. We show that the new statistics are much more powerful than the corresponding statistics and the power tends to 1 as the sequence length tends to infinity under the pattern transfer model. Copyright © 2011 Elsevier Ltd. All rights reserved.

New Powerful Statistics for Alignment-free Sequence Comparison Under a Pattern Transfer Model

PubMed Central

Liu, Xuemei; Wan, Lin; Li, Jing; Reinert, Gesine; Waterman, Michael S.; Sun, Fengzhu

2011-01-01

Alignment-free sequence comparison is widely used for comparing gene regulatory regions and for identifying horizontally transferred genes. Recent studies on the power of a widely used alignment-free comparison statistic D2 and its variants D2∗ and D2s showed that their power approximates a limit smaller than 1 as the sequence length tends to infinity under a pattern transfer model. We develop new alignment-free statistics based on D2, D2∗ and D2s by comparing local sequence pairs and then summing over all the local sequence pairs of certain length. We show that the new statistics are much more powerful than the corresponding statistics and the power tends to 1 as the sequence length tends to infinity under the pattern transfer model. PMID:21723298

Self-aligned nanoforest in silicon nanowire for sensitive conductance modulation.

PubMed

Seol, Myeong-Lok; Ahn, Jae-Hyuk; Choi, Ji-Min; Choi, Sung-Jin; Choi, Yang-Kyu

2012-11-14

A self-aligned and localized nanoforest structure is constructed in a top-down fabricated silicon nanowire (SiNW). The surface-to-volume ratio (SVR) of the SiNW is enhanced due to the local nanoforest formation. The conductance modulation property of the SiNWs, which is an important characteristic in sensor and charge transfer based applications, can be largely enhanced. For the selective modification of the channel region, localized Joule-heating and subsequent metal-assisted chemical etching (mac-etch) are employed. The nanoforest is formed only in the channel region without misalignment due to the self-aligned process of Joule-heating. The modified SiNW is applied to a porphyrin-silicon hybrid device to verify the enhanced conductance modulation. The charge transfer efficiency between the porphyrin and the SiNW, which is caused by external optical excitation, is clearly increased compared to the initial SiNW. The effect of the local nanoforest formation is enhanced when longer etching times and larger widths are used.

ARYANA: Aligning Reads by Yet Another Approach

PubMed Central

2014-01-01

Motivation Although there are many different algorithms and software tools for aligning sequencing reads, fast gapped sequence search is far from solved. Strong interest in fast alignment is best reflected in the $106 prize for the Innocentive competition on aligning a collection of reads to a given database of reference genomes. In addition, de novo assembly of next-generation sequencing long reads requires fast overlap-layout-concensus algorithms which depend on fast and accurate alignment. Contribution We introduce ARYANA, a fast gapped read aligner, developed on the base of BWA indexing infrastructure with a completely new alignment engine that makes it significantly faster than three other aligners: Bowtie2, BWA and SeqAlto, with comparable generality and accuracy. Instead of the time-consuming backtracking procedures for handling mismatches, ARYANA comes with the seed-and-extend algorithmic framework and a significantly improved efficiency by integrating novel algorithmic techniques including dynamic seed selection, bidirectional seed extension, reset-free hash tables, and gap-filling dynamic programming. As the read length increases ARYANA's superiority in terms of speed and alignment rate becomes more evident. This is in perfect harmony with the read length trend as the sequencing technologies evolve. The algorithmic platform of ARYANA makes it easy to develop mission-specific aligners for other applications using ARYANA engine. Availability ARYANA with complete source code can be obtained from http://github.com/aryana-aligner PMID:25252881

ARYANA: Aligning Reads by Yet Another Approach.

PubMed

Gholami, Milad; Arbabi, Aryan; Sharifi-Zarchi, Ali; Chitsaz, Hamidreza; Sadeghi, Mehdi

2014-01-01

Although there are many different algorithms and software tools for aligning sequencing reads, fast gapped sequence search is far from solved. Strong interest in fast alignment is best reflected in the $10(6) prize for the Innocentive competition on aligning a collection of reads to a given database of reference genomes. In addition, de novo assembly of next-generation sequencing long reads requires fast overlap-layout-concensus algorithms which depend on fast and accurate alignment. We introduce ARYANA, a fast gapped read aligner, developed on the base of BWA indexing infrastructure with a completely new alignment engine that makes it significantly faster than three other aligners: Bowtie2, BWA and SeqAlto, with comparable generality and accuracy. Instead of the time-consuming backtracking procedures for handling mismatches, ARYANA comes with the seed-and-extend algorithmic framework and a significantly improved efficiency by integrating novel algorithmic techniques including dynamic seed selection, bidirectional seed extension, reset-free hash tables, and gap-filling dynamic programming. As the read length increases ARYANA's superiority in terms of speed and alignment rate becomes more evident. This is in perfect harmony with the read length trend as the sequencing technologies evolve. The algorithmic platform of ARYANA makes it easy to develop mission-specific aligners for other applications using ARYANA engine. ARYANA with complete source code can be obtained from http://github.com/aryana-aligner.

NetCoffee: a fast and accurate global alignment approach to identify functionally conserved proteins in multiple networks.

PubMed

Hu, Jialu; Kehr, Birte; Reinert, Knut

2014-02-15

Owing to recent advancements in high-throughput technologies, protein-protein interaction networks of more and more species become available in public databases. The question of how to identify functionally conserved proteins across species attracts a lot of attention in computational biology. Network alignments provide a systematic way to solve this problem. However, most existing alignment tools encounter limitations in tackling this problem. Therefore, the demand for faster and more efficient alignment tools is growing. We present a fast and accurate algorithm, NetCoffee, which allows to find a global alignment of multiple protein-protein interaction networks. NetCoffee searches for a global alignment by maximizing a target function using simulated annealing on a set of weighted bipartite graphs that are constructed using a triplet approach similar to T-Coffee. To assess its performance, NetCoffee was applied to four real datasets. Our results suggest that NetCoffee remedies several limitations of previous algorithms, outperforms all existing alignment tools in terms of speed and nevertheless identifies biologically meaningful alignments. The source code and data are freely available for download under the GNU GPL v3 license at https://code.google.com/p/netcoffee/.

Protein local structure alignment under the discrete Fréchet distance.

PubMed

Zhu, Binhai

2007-12-01

Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very few results are known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fréchet distance, and with the application of protein-related research, a related discrete Fréchet distance has been used recently. In this paper, following the recent work of Jiang et al. we investigate the protein local structural alignment problem using bounded discrete Fréchet distance. Given m proteins (or protein backbones, which are 3D polygonal chains), each of length O(n), our main results are summarized as follows: * If the number of proteins, m, is not part of the input, then the problem is NP-complete; moreover, under bounded discrete Fréchet distance it is NP-hard to approximate the maximum size common local structure within a factor of n(1-epsilon). These results hold both when all the proteins are static and when translation/rotation are allowed. * If the number of proteins, m, is a constant, then there is a polynomial time solution for the problem.

Identification and analysis of multigene families by comparison of exon fingerprints.

PubMed

Brown, N P; Whittaker, A J; Newell, W R; Rawlings, C J; Beck, S

1995-06-02

Gene families are often recognised by sequence homology using similarity searching to find relationships, however, genomic sequence data provides gene architectural information not used by conventional search methods. In particular, intron positions and phases are expected to be relatively conserved features, because mis-splicing and reading frame shifts should be selected against. A fast search technique capable of detecting possible weak sequence homologies apparent at the intron/exon level of gene organization is presented for comparing spliceosomal genes and gene fragments. FINEX compares strings of exons delimited by intron/exon boundary positions and intron phases (exon fingerprint) using a global dynamic programming algorithm with a combined intron phase identity and exon size dissimilarity score. Exon fingerprints are typically two orders of magnitude smaller than their nucleic acid sequence counterparts giving rise to fast search times: a ranked search against a library of 6755 fingerprints for a typical three exon fingerprint completes in under 30 seconds on an ordinary workstation, while a worst case largest fingerprint of 52 exons completes in just over one minute. The short "sequence" length of exon fingerprints in comparisons is compensated for by the large exon alphabet compounded of intron phase types and a wide range of exon sizes, the latter contributing the most information to alignments. FINEX performs better in some searches than conventional methods, finding matches with similar exon organization, but low sequence homology. A search using a human serum albumin finds all members of the multigene family in the FINEX database at the top of the search ranking, despite very low amino acid percentage identities between family members. The method should complement conventional sequence searching and alignment techniques, offering a means of identifying otherwise hard to detect homologies where genomic data are available.

FoldMiner and LOCK 2: protein structure comparison and motif discovery on the web.

PubMed

Shapiro, Jessica; Brutlag, Douglas

2004-07-01

The FoldMiner web server (http://foldminer.stanford.edu/) provides remote access to methods for protein structure alignment and unsupervised motif discovery. FoldMiner is unique among such algorithms in that it improves both the motif definition and the sensitivity of a structural similarity search by combining the search and motif discovery methods and using information from each process to enhance the other. In a typical run, a query structure is aligned to all structures in one of several databases of single domain targets in order to identify its structural neighbors and to discover a motif that is the basis for the similarity among the query and statistically significant targets. This process is fully automated, but options for manual refinement of the results are available as well. The server uses the Chime plugin and customized controls to allow for visualization of the motif and of structural superpositions. In addition, we provide an interface to the LOCK 2 algorithm for rapid alignments of a query structure to smaller numbers of user-specified targets.

The VirusBanker database uses a Java program to allow flexible searching through Bunyaviridae sequences.

PubMed

Fourment, Mathieu; Gibbs, Mark J

2008-02-05

Viruses of the Bunyaviridae have segmented negative-stranded RNA genomes and several of them cause significant disease. Many partial sequences have been obtained from the segments so that GenBank searches give complex results. Sequence databases usually use HTML pages to mediate remote sorting, but this approach can be limiting and may discourage a user from exploring a database. The VirusBanker database contains Bunyaviridae sequences and alignments and is presented as two spreadsheets generated by a Java program that interacts with a MySQL database on a server. Sequences are displayed in rows and may be sorted using information that is displayed in columns and includes data relating to the segment, gene, protein, species, strain, sequence length, terminal sequence and date and country of isolation. Bunyaviridae sequences and alignments may be downloaded from the second spreadsheet with titles defined by the user from the columns, or viewed when passed directly to the sequence editor, Jalview. VirusBanker allows large datasets of aligned nucleotide and protein sequences from the Bunyaviridae to be compiled and winnowed rapidly using criteria that are formulated heuristically.

Mitigation of Angle Tracking Errors Due to Color Dependent Centroid Shifts in SIM-Lite

NASA Technical Reports Server (NTRS)

Nemati, Bijan; An, Xin; Goullioud, Renaud; Shao, Michael; Shen, Tsae-Pyng; Wehmeier, Udo J.; Weilert, Mark A.; Wang, Xu; Werne, Thomas A.; Wu, Janet P.;

Accuracy of Binary Black Hole waveforms for Advanced LIGO searches

NASA Astrophysics Data System (ADS)

Kumar, Prayush; Barkett, Kevin; Bhagwat, Swetha; Chu, Tony; Fong, Heather; Brown, Duncan; Pfeiffer, Harald; Scheel, Mark; Szilagyi, Bela

2015-04-01

Coalescing binaries of compact objects are flagship sources for the first direct detection of gravitational waves with LIGO-Virgo observatories. Matched-filtering based detection searches aimed at binaries of black holes will use aligned spin waveforms as filters, and their efficiency hinges on the accuracy of the underlying waveform models. A number of gravitational waveform models are available in literature, e.g. the Effective-One-Body, Phenomenological, and traditional post-Newtonian ones. While Numerical Relativity (NR) simulations provide for the most accurate modeling of gravitational radiation from compact binaries, their computational cost limits their application in large scale searches. In this talk we assess the accuracy of waveform models in two regions of parameter space, which have only been explored cursorily in the past: the high mass-ratio regime as well as the comparable mass-ratio + high spin regime.s Using the SpEC code, six q = 7 simulations with aligned-spins and lasting 60 orbits, and tens of q ∈ [1,3] simulations with high black hole spins were performed. We use them to study the accuracy and intrinsic parameter biases of different waveform families, and assess their viability for Advanced LIGO searches.

Protein structure database search and evolutionary classification.

PubMed

Yang, Jinn-Moon; Tung, Chi-Hua

2006-01-01

As more protein structures become available and structural genomics efforts provide structural models in a genome-wide strategy, there is a growing need for fast and accurate methods for discovering homologous proteins and evolutionary classifications of newly determined structures. We have developed 3D-BLAST, in part, to address these issues. 3D-BLAST is as fast as BLAST and calculates the statistical significance (E-value) of an alignment to indicate the reliability of the prediction. Using this method, we first identified 23 states of the structural alphabet that represent pattern profiles of the backbone fragments and then used them to represent protein structure databases as structural alphabet sequence databases (SADB). Our method enhanced BLAST as a search method, using a new structural alphabet substitution matrix (SASM) to find the longest common substructures with high-scoring structured segment pairs from an SADB database. Using personal computers with Intel Pentium4 (2.8 GHz) processors, our method searched more than 10 000 protein structures in 1.3 s and achieved a good agreement with search results from detailed structure alignment methods. [3D-BLAST is available at http://3d-blast.life.nctu.edu.tw].

An intuitive graphical webserver for multiple-choice protein sequence search.

PubMed

Banky, Daniel; Szalkai, Balazs; Grolmusz, Vince

2014-04-10

Every day tens of thousands of sequence searches and sequence alignment queries are submitted to webservers. The capitalized word "BLAST" becomes a verb, describing the act of performing sequence search and alignment. However, if one needs to search for sequences that contain, for example, two hydrophobic and three polar residues at five given positions, the query formation on the most frequently used webservers will be difficult. Some servers support the formation of queries with regular expressions, but most of the users are unfamiliar with their syntax. Here we present an intuitive, easily applicable webserver, the Protein Sequence Analysis server, that allows the formation of multiple choice queries by simply drawing the residues to their positions; if more than one residue are drawn to the same position, then they will be nicely stacked on the user interface, indicating the multiple choice at the given position. This computer-game-like interface is natural and intuitive, and the coloring of the residues makes possible to form queries requiring not just certain amino acids in the given positions, but also small nonpolar, negatively charged, hydrophobic, positively charged, or polar ones. The webserver is available at http://psa.pitgroup.org. Copyright © 2014 Elsevier B.V. All rights reserved.

Matt: local flexibility aids protein multiple structure alignment.

PubMed

Menke, Matthew; Berger, Bonnie; Cowen, Lenore

2008-01-01

Even when there is agreement on what measure a protein multiple structure alignment should be optimizing, finding the optimal alignment is computationally prohibitive. One approach used by many previous methods is aligned fragment pair chaining, where short structural fragments from all the proteins are aligned against each other optimally, and the final alignment chains these together in geometrically consistent ways. Ye and Godzik have recently suggested that adding geometric flexibility may help better model protein structures in a variety of contexts. We introduce the program Matt (Multiple Alignment with Translations and Twists), an aligned fragment pair chaining algorithm that, in intermediate steps, allows local flexibility between fragments: small translations and rotations are temporarily allowed to bring sets of aligned fragments closer, even if they are physically impossible under rigid body transformations. After a dynamic programming assembly guided by these "bent" alignments, geometric consistency is restored in the final step before the alignment is output. Matt is tested against other recent multiple protein structure alignment programs on the popular Homstrad and SABmark benchmark datasets. Matt's global performance is competitive with the other programs on Homstrad, but outperforms the other programs on SABmark, a benchmark of multiple structure alignments of proteins with more distant homology. On both datasets, Matt demonstrates an ability to better align the ends of alpha-helices and beta-strands, an important characteristic of any structure alignment program intended to help construct a structural template library for threading approaches to the inverse protein-folding problem. The related question of whether Matt alignments can be used to distinguish distantly homologous structure pairs from pairs of proteins that are not homologous is also considered. For this purpose, a p-value score based on the length of the common core and average root mean squared deviation (RMSD) of Matt alignments is shown to largely separate decoys from homologous protein structures in the SABmark benchmark dataset. We postulate that Matt's strong performance comes from its ability to model proteins in different conformational states and, perhaps even more important, its ability to model backbone distortions in more distantly related proteins.

Computer vision applications for coronagraphic optical alignment and image processing.

PubMed

Savransky, Dmitry; Thomas, Sandrine J; Poyneer, Lisa A; Macintosh, Bruce A

2013-05-10

Modern coronagraphic systems require very precise alignment between optical components and can benefit greatly from automated image processing. We discuss three techniques commonly employed in the fields of computer vision and image analysis as applied to the Gemini Planet Imager, a new facility instrument for the Gemini South Observatory. We describe how feature extraction and clustering methods can be used to aid in automated system alignment tasks, and also present a search algorithm for finding regular features in science images used for calibration and data processing. Along with discussions of each technique, we present our specific implementation and show results of each one in operation.

Localization accuracy from automatic and semi-automatic rigid registration of locally-advanced lung cancer targets during image-guided radiation therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Robertson, Scott P.; Weiss, Elisabeth; Hugo, Geoffrey D.

2012-01-15

Purpose: To evaluate localization accuracy resulting from rigid registration of locally-advanced lung cancer targets using fully automatic and semi-automatic protocols for image-guided radiation therapy. Methods: Seventeen lung cancer patients, fourteen also presenting with involved lymph nodes, received computed tomography (CT) scans once per week throughout treatment under active breathing control. A physician contoured both lung and lymph node targets for all weekly scans. Various automatic and semi-automatic rigid registration techniques were then performed for both individual and simultaneous alignments of the primary gross tumor volume (GTV{sub P}) and involved lymph nodes (GTV{sub LN}) to simulate the localization process in image-guidedmore » radiation therapy. Techniques included ''standard'' (direct registration of weekly images to a planning CT), ''seeded'' (manual prealignment of targets to guide standard registration), ''transitive-based'' (alignment of pretreatment and planning CTs through one or more intermediate images), and ''rereferenced'' (designation of a new reference image for registration). Localization error (LE) was assessed as the residual centroid and border distances between targets from planning and weekly CTs after registration. Results: Initial bony alignment resulted in centroid LE of 7.3 {+-} 5.4 mm and 5.4 {+-} 3.4 mm for the GTV{sub P} and GTV{sub LN}, respectively. Compared to bony alignment, transitive-based and seeded registrations significantly reduced GTV{sub P} centroid LE to 4.7 {+-} 3.7 mm (p = 0.011) and 4.3 {+-} 2.5 mm (p < 1 x 10{sup -3}), respectively, but the smallest GTV{sub P} LE of 2.4 {+-} 2.1 mm was provided by rereferenced registration (p < 1 x 10{sup -6}). Standard registration significantly reduced GTV{sub LN} centroid LE to 3.2 {+-} 2.5 mm (p < 1 x 10{sup -3}) compared to bony alignment, with little additional gain offered by the other registration techniques. For simultaneous target alignment, centroid LE as low as 3.9 {+-} 2.7 mm and 3.8 {+-} 2.3 mm were achieved for the GTV{sub P} and GTV{sub LN}, respectively, using rereferenced registration. Conclusions: Target shape, volume, and configuration changes during radiation therapy limited the accuracy of standard rigid registration for image-guided localization in locally-advanced lung cancer. Significant error reductions were possible using other rigid registration techniques, with LE approaching the lower limit imposed by interfraction target variability throughout treatment.« less

Molecular Identification of Food Sources in Triatomines in the Brazilian Northeast: Roles of Goats and Rodents in Chagas Disease Epidemiology

PubMed Central

Valença-Barbosa, Carolina; Fernandes, Fabiano Araújo; Santos, Helena Lucia Carneiro; Sarquis, Otília; Harry, Myriam; Almeida, Carlos Eduardo; Lima, Marli Maria

2015-01-01

We used the gut contents of triatomines collected from rural areas of Ceará State, northeastern Brazil, to identify their putative hosts via vertebrate cytb gene sequencing. Successful direct sequencing was obtained for 48% of insects, comprising 50 Triatoma brasiliensis, 7 Triatoma pseudomaculata, and 1 Rhodnius nasutus. Basic local alignment search tool (BLAST) procedure revealed that domestic animals, such as chickens (Gallus gallus) and goats (Capra hircus), are the main food source, including in sylvatic environment. Native hosts were also detected in peridomestic environment such as reptiles (Tropidurus sp. and Iguana iguana) and the Galea spixii (Rodentia: Caviidae). The role of goats and Galea spixii in Chagas disease epidemiology calls for further studies, because these mammals likely link the sylvatic and domestic Trypanosoma cruzi cycles. PMID:26350453

Independent Metrics for Protein Backbone and Side-Chain Flexibility: Time Scales and Effects of Ligand Binding.

PubMed

Fuchs, Julian E; Waldner, Birgit J; Huber, Roland G; von Grafenstein, Susanne; Kramer, Christian; Liedl, Klaus R

2015-03-10

Conformational dynamics are central for understanding biomolecular structure and function, since biological macromolecules are inherently flexible at room temperature and in solution. Computational methods are nowadays capable of providing valuable information on the conformational ensembles of biomolecules. However, analysis tools and intuitive metrics that capture dynamic information from in silico generated structural ensembles are limited. In standard work-flows, flexibility in a conformational ensemble is represented through residue-wise root-mean-square fluctuations or B-factors following a global alignment. Consequently, these approaches relying on global alignments discard valuable information on local dynamics. Results inherently depend on global flexibility, residue size, and connectivity. In this study we present a novel approach for capturing positional fluctuations based on multiple local alignments instead of one single global alignment. The method captures local dynamics within a structural ensemble independent of residue type by splitting individual local and global degrees of freedom of protein backbone and side-chains. Dependence on residue type and size in the side-chains is removed via normalization with the B-factors of the isolated residue. As a test case, we demonstrate its application to a molecular dynamics simulation of bovine pancreatic trypsin inhibitor (BPTI) on the millisecond time scale. This allows for illustrating different time scales of backbone and side-chain flexibility. Additionally, we demonstrate the effects of ligand binding on side-chain flexibility of three serine proteases. We expect our new methodology for quantifying local flexibility to be helpful in unraveling local changes in biomolecular dynamics.

Identification of a Herbal Powder by Deoxyribonucleic Acid Barcoding and Structural Analyses.

PubMed

Sheth, Bhavisha P; Thaker, Vrinda S

2015-10-01

Authentic identification of plants is essential for exploiting their medicinal properties as well as to stop the adulteration and malpractices with the trade of the same. To identify a herbal powder obtained from a herbalist in the local vicinity of Rajkot, Gujarat, using deoxyribonucleic acid (DNA) barcoding and molecular tools. The DNA was extracted from a herbal powder and selected Cassia species, followed by the polymerase chain reaction (PCR) and sequencing of the rbcL barcode locus. Thereafter the sequences were subjected to National Center for Biotechnology Information (NCBI) basic local alignment search tool (BLAST) analysis, followed by the protein three-dimension structure determination of the rbcL protein from the herbal powder and Cassia species namely Cassia fistula, Cassia tora and Cassia javanica (sequences obtained in the present study), Cassia Roxburghii, and Cassia abbreviata (sequences retrieved from Genbank). Further, the multiple and pairwise structural alignment were carried out in order to identify the herbal powder. The nucleotide sequences obtained from the selected species of Cassia were submitted to Genbank (Accession No. JX141397, JX141405, JX141420). The NCBI BLAST analysis of the rbcL protein from the herbal powder showed an equal sequence similarity (with reference to different parameters like E value, maximum identity, total score, query coverage) to C. javanica and C. roxburghii. In order to solve the ambiguities of the BLAST result, a protein structural approach was implemented. The protein homology models obtained in the present study were submitted to the protein model database (PM0079748-PM0079753). The pairwise structural alignment of the herbal powder (as template) and C. javanica and C. roxburghii (as targets individually) revealed a close similarity of the herbal powder with C. javanica. A strategy as used here, incorporating the integrated use of DNA barcoding and protein structural analyses could be adopted, as a novel rapid and economic procedure, especially in cases when protein coding loci are considered. Authentic identification of plants is essential for exploiting their medicinal properties as well as to stop the adulteration and malpractices with the trade of the same. A herbal powder was obtained from a herbalist in the local vicinity of Rajkot, Gujarat. An integrated approach using DNA barcoding and structural analyses was carried out to identify the herbal powder. The herbal powder was identified as Cassia javanica L.

BEAUTY-X: enhanced BLAST searches for DNA queries.

PubMed

Worley, K C; Culpepper, P; Wiese, B A; Smith, R F

1998-01-01

BEAUTY (BLAST Enhanced Alignment Utility) is an enhanced version of the BLAST database search tool that facilitates identification of the functions of matched sequences. Three recent improvements to the BEAUTY program described here make the enhanced output (1) available for DNA queries, (2) available for searches of any protein database, and (3) more up-to-date, with periodic updates of the domain information. BEAUTY searches of the NCBI and EMBL non-redundant protein sequence databases are available from the BCM Search Launcher Web pages (http://gc.bcm.tmc. edu:8088/search-launcher/launcher.html). BEAUTY Post-Processing of submitted search results is available using the BCM Search Launcher Batch Client (version 2.6) (ftp://gc.bcm.tmc. edu/pub/software/search-launcher/). Example figures are available at http://dot.bcm.tmc. edu:9331/papers/beautypp.html (kworley,culpep)@bcm.tmc.edu

A Practical, Robust and Fast Method for Location Localization in Range-Based Systems.

PubMed

Huang, Shiping; Wu, Zhifeng; Misra, Anil

2017-12-11

Location localization technology is used in a number of industrial and civil applications. Real time location localization accuracy is highly dependent on the quality of the distance measurements and efficiency of solving the localization equations. In this paper, we provide a novel approach to solve the nonlinear localization equations efficiently and simultaneously eliminate the bad measurement data in range-based systems. A geometric intersection model was developed to narrow the target search area, where Newton's Method and the Direct Search Method are used to search for the unknown position. Not only does the geometric intersection model offer a small bounded search domain for Newton's Method and the Direct Search Method, but also it can self-correct bad measurement data. The Direct Search Method is useful for the coarse localization or small target search domain, while the Newton's Method can be used for accurate localization. For accurate localization, by utilizing the proposed Modified Newton's Method (MNM), challenges of avoiding the local extrema, singularities, and initial value choice are addressed. The applicability and robustness of the developed method has been demonstrated by experiments with an indoor system.

Simulation of enhanced deposition due to magnetic field alignment of ellipsoidal particles in a lung bifurcation.

PubMed

Martinez, R C; Roshchenko, A; Minev, P; Finlay, W H

2013-02-01

Aerosolized chemotherapy has been recognized as a potential treatment for lung cancer. The challenge of providing sufficient therapeutic effects without reaching dose-limiting toxicity levels hinders the development of aerosolized chemotherapy. This could be mitigated by increasing drug-delivery efficiency with a noninvasive drug-targeting delivery method. The purpose of this study is to use direct numerical simulations to study the resulting local enhancement of deposition due to magnetic field alignment of high aspect ratio particles. High aspect ratio particles were approximated by a rigid ellipsoid with a minor diameter of 0.5 μm and fluid particle density ratio of 1,000. Particle trajectories were calculated by solving the coupled fluid particle equations using an in-house micro-macro grid finite element algorithm based on a previously developed fictitious domain approach. Particle trajectories were simulated in a morphologically realistic geometry modeling a symmetrical terminal bronchiole bifurcation. Flow conditions were steady inspiratory air flow due to typical breathing at 18 L/min. Deposition efficiency was estimated for two different cases: [1] particles aligned with the streamlines and [2] particles with fixed angular orientation simulating the magnetic field alignment of our previous in vitro study. The local enhancement factor defined as the ratio between deposition efficiency of Case [1] and Case [2] was found to be 1.43 and 3.46 for particles with an aspect ratio of 6 and 20, respectively. Results indicate that externally forcing local alignment of high aspect ratio particles can increase local deposition considerably.

High yield growth of patterned vertically aligned carbon nanotubes using inkjet-printed catalyst.

PubMed

Beard, James D; Stringer, Jonathan; Ghita, Oana R; Smith, Patrick J

2013-10-09

This study reports on the fabrication of vertically aligned carbon nanotubes localized at specific sites on a growth substrate by deposition of a nanoparticle suspension using inkjet printing. Carbon nanotubes were grown with high yield as vertically aligned forests to a length of approximately 400 μm. The use of inkjet printing for catalyst fabrication considerably improves the production rate of vertically aligned patterned nanotube forests compared with conventional patterning techniques, for example, electron beam lithography or photolithography.

The Yak genome database: an integrative database for studying yak biology and high-altitude adaption

PubMed Central

2012-01-01

Background The yak (Bos grunniens) is a long-haired bovine that lives at high altitudes and is an important source of milk, meat, fiber and fuel. The recent sequencing, assembly and annotation of its genome are expected to further our understanding of the means by which it has adapted to life at high altitudes and its ecologically important traits. Description The Yak Genome Database (YGD) is an internet-based resource that provides access to genomic sequence data and predicted functional information concerning the genes and proteins of Bos grunniens. The curated data stored in the YGD includes genome sequences, predicted genes and associated annotations, non-coding RNA sequences, transposable elements, single nucleotide variants, and three-way whole-genome alignments between human, cattle and yak. YGD offers useful searching and data mining tools, including the ability to search for genes by name or using function keywords as well as GBrowse genome browsers and/or BLAST servers, which can be used to visualize genome regions and identify similar sequences. Sequence data from the YGD can also be downloaded to perform local searches. Conclusions A new yak genome database (YGD) has been developed to facilitate studies on high-altitude adaption and bovine genomics. The database will be continuously updated to incorporate new information such as transcriptome data and population resequencing data. The YGD can be accessed at http://me.lzu.edu.cn/yak. PMID:23134687

LPV Modeling of a Flexible Wing Aircraft Using Modal Alignment and Adaptive Gridding Methods

NASA Technical Reports Server (NTRS)

Al-Jiboory, Ali Khudhair; Zhu, Guoming; Swei, Sean Shan-Min; Su, Weihua; Nguyen, Nhan T.

2017-01-01

One of the earliest approaches in gain-scheduling control is the gridding based approach, in which a set of local linear time-invariant models are obtained at various gridded points corresponding to the varying parameters within the flight envelop. In order to ensure smooth and effective Linear Parameter-Varying control, aligning all the flexible modes within each local model and maintaining small number of representative local models over the gridded parameter space are crucial. In addition, since the flexible structural models tend to have large dimensions, a tractable model reduction process is necessary. In this paper, the notion of s-shifted H2- and H Infinity-norm are introduced and used as a metric to measure the model mismatch. A new modal alignment algorithm is developed which utilizes the defined metric for aligning all the local models over the entire gridded parameter space. Furthermore, an Adaptive Grid Step Size Determination algorithm is developed to minimize the number of local models required to represent the gridded parameter space. For model reduction, we propose to utilize the concept of Composite Modal Cost Analysis, through which the collective contribution of each flexible mode is computed and ranked. Therefore, a reduced-order model is constructed by retaining only those modes with significant contribution. The NASA Generic Transport Model operating at various flight speeds is studied for verification purpose, and the analysis and simulation results demonstrate the effectiveness of the proposed modeling approach.

Molecular characterization and expression analysis of three novel autophagy-related genes from the cattle tick Rhipicephalus (Boophilus) microplus (Acari: Ixodidae).

PubMed

Flores Fernández, José Miguel; Barragán Álvarez, Carla Patricia; Sánchez Hernández, Carla Vanessa; Padilla Camberos, Eduardo; González Castillo, Celia; Ortuño Sahagún, Daniel; Martínez Velázquez, Moisés

2016-11-01

The cattle tick Rhipicephalus (Boophilus) microplus is a hematophagous ectoparasite of major importance for the livestock industry. It shows a remarkable ability to survive over long periods without feeding. However, the mechanisms used to endure long-term starvation are poorly understood. It is believed that autophagy, a process of intracellular protein degradation, may play a significant role to confront adverse environmental conditions. To advance our understanding of autophagy in R. microplus, in the present study we report the molecular characterization of three autophagy-related (ATG) genes, namely, RmATG3, RmATG4 and RmATG6, as well as their expression profiles in different developmental stages and organs of the parasite. The deduced amino acid sequences derived from the characterized gene sequences were subjected to Basic Local Alignment Search Tool analysis. The testing produced significant alignments with respective ATG proteins from Haemaphysalis longicornis and Ixodes scapularis ticks. Real-time polymerase chain reaction assays revealed that RmATG4 and RmATG6 transcripts were elevated in egg and ovary tissue, when compared with larva and midgut samples, while RmATG3 expression in midgut was 2-fold higher than in egg, larva and ovary samples.

SA-Search: a web tool for protein structure mining based on a Structural Alphabet

PubMed Central

Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre

2004-01-01

SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of fast 3D similarity searches such as the extraction of exact words using a suffix tree approach, and the search for fuzzy words viewed as a simple 1D sequence alignment problem. SA-Search is available at http://bioserv.rpbs.jussieu.fr/cgi-bin/SA-Search. PMID:15215446

SA-Search: a web tool for protein structure mining based on a Structural Alphabet.

PubMed

Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre

2004-07-01

SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of fast 3D similarity searches such as the extraction of exact words using a suffix tree approach, and the search for fuzzy words viewed as a simple 1D sequence alignment problem. SA-Search is available at http://bioserv.rpbs.jussieu.fr/cgi-bin/SA-Search.

Preservation or Restoration of Segmental and Regional Spinal Lordosis Using Minimally Invasive Interbody Fusion Techniques in Degenerative Lumbar Conditions: A Literature Review.

PubMed

Uribe, Juan S; Myhre, Sue Lynn; Youssef, Jim A

2016-04-01

A literature review. The purpose of this study was to review lumbar segmental and regional alignment changes following treatment with a variety of minimally invasive surgery (MIS) interbody fusion procedures for short-segment, degenerative conditions. An increasing number of lumbar fusions are being performed with minimally invasive exposures, despite a perception that minimally invasive lumbar interbody fusion procedures are unable to affect segmental and regional lordosis. Through a MEDLINE and Google Scholar search, a total of 23 articles were identified that reported alignment following minimally invasive lumbar fusion for degenerative (nondeformity) lumbar spinal conditions to examine aggregate changes in postoperative alignment. Of the 23 studies identified, 28 study cohorts were included in the analysis. Procedural cohorts included MIS ALIF (two), extreme lateral interbody fusion (XLIF) (16), and MIS posterior/transforaminal lumbar interbody fusion (P/TLIF) (11). Across 19 study cohorts and 720 patients, weighted average of lumbar lordosis preoperatively for all procedures was 43.5° (range 28.4°-52.5°) and increased 3.4° (9%) (range -2° to 7.4°) postoperatively (P < 0.001). Segmental lordosis increased, on average, by 4° from a weighted average of 8.3° preoperatively (range -0.8° to 15.8°) to 11.2° at postoperative time points (range -0.2° to 22.8°) (P < 0.001) in 1182 patient from 24 study cohorts. Simple linear regression revealed a significant relationship between preoperative lumbar lordosis and change in lumbar lordosis (r = 0.413; P = 0.003), wherein lower preoperative lumbar lordosis predicted a greater increase in postoperative lumbar lordosis. Significant gains in both weighted average lumbar lordosis and segmental lordosis were seen following MIS interbody fusion. None of the segmental lordosis cohorts and only two of the 19 lumbar lordosis cohorts showed decreases in lordosis postoperatively. These results suggest that MIS approaches are able to impact regional and local segmental alignment and that preoperative patient factors can impact the extent of correction gained (preserving vs. restoring alignment). 4.

[Screening and identification of a bacterium capable of converting agar to neoagaro oligosaccharides].

PubMed

Han, Junping; Huang, Yayan; Ye, Jing; Xiao, Meitian

2015-09-04

To screen and identify a bacterium capable of converting agar to neoagaro oligosaccharides. We took samples of porphyra haitanensis and nearby seawater, and then used the medium containing 1 per thousand agar to enrich the target bacteria. The target isolates were obtained by dilution-plate method, of which crude enzymes were further obtained by liquid culture. We adopted DNS method to determine the target bacteria which can convert agar to neoagaro oligosaccharides. The phylogenetics was identified by analyzing 16S rDNA sequence and combining the strain's morphological and bacterial colonial physiological biochemical characteristics. We isolated a gram-negative bacterial strain HJPHYXJ-1 capable of transforming agar to neoagaro oligosaccharides. Basic Local Alignment Search Tool (BLAST) search of HJPHYXJ-1's 16S rDNA sequence on GenBank suggested that the similarity between this strain and Vibrio natriegens reached 99% . In addition, the morphological and physiological biochemical characteristics of HJPHYXJ-1 also showed highly similarity to Vibrio natriegens. So we identified HJPHYXJ-1 as Vibrio natriegens. The results of HPLC suggested that the metabolite of enzymatic degradation was neoagaro oligosaccharides. HJPHYXJ-1 or the new isolate of Vibrio natriegens was capable of converting agar to neoagaro oligosaccharides.

Detecting authorized and unauthorized genetically modified organisms containing vip3A by real-time PCR and next-generation sequencing.

PubMed

Liang, Chanjuan; van Dijk, Jeroen P; Scholtens, Ingrid M J; Staats, Martijn; Prins, Theo W; Voorhuijzen, Marleen M; da Silva, Andrea M; Arisi, Ana Carolina Maisonnave; den Dunnen, Johan T; Kok, Esther J

2014-04-01

The growing number of biotech crops with novel genetic elements increasingly complicates the detection of genetically modified organisms (GMOs) in food and feed samples using conventional screening methods. Unauthorized GMOs (UGMOs) in food and feed are currently identified through combining GMO element screening with sequencing the DNA flanking these elements. In this study, a specific and sensitive qPCR assay was developed for vip3A element detection based on the vip3Aa20 coding sequences of the recently marketed MIR162 maize and COT102 cotton. Furthermore, SiteFinding-PCR in combination with Sanger, Illumina or Pacific BioSciences (PacBio) sequencing was performed targeting the flanking DNA of the vip3Aa20 element in MIR162. De novo assembly and Basic Local Alignment Search Tool searches were used to mimic UGMO identification. PacBio data resulted in relatively long contigs in the upstream (1,326 nucleotides (nt); 95 % identity) and downstream (1,135 nt; 92 % identity) regions, whereas Illumina data resulted in two smaller contigs of 858 and 1,038 nt with higher sequence identity (>99 % identity). Both approaches outperformed Sanger sequencing, underlining the potential for next-generation sequencing in UGMO identification.

GenomeVista

DOE Office of Scientific and Technical Information (OSTI.GOV)

Poliakov, Alexander; Couronne, Olivier

2002-11-04

Aligning large vertebrate genomes that are structurally complex poses a variety of problems not encountered on smaller scales. Such genomes are rich in repetitive elements and contain multiple segmental duplications, which increases the difficulty of identifying true orthologous SNA segments in alignments. The sizes of the sequences make many alignment algorithms designed for comparing single proteins extremely inefficient when processing large genomic intervals. We integrated both local and global alignment tools and developed a suite of programs for automatically aligning large vertebrate genomes and identifying conserved non-coding regions in the alignments. Our method uses the BLAT local alignment program tomore » find anchors on the base genome to identify regions of possible homology for a query sequence. These regions are postprocessed to find the best candidates which are then globally aligned using the AVID global alignment program. In the last step conserved non-coding segments are identified using VISTA. Our methods are fast and the resulting alignments exhibit a high degree of sensitivity, covering more than 90% of known coding exons in the human genome. The GenomeVISTA software is a suite of Perl programs that is built on a MySQL database platform. The scheduler gets control data from the database, builds a queve of jobs, and dispatches them to a PC cluster for execution. The main program, running on each node of the cluster, processes individual sequences. A Perl library acts as an interface between the database and the above programs. The use of a separate library allows the programs to function independently of the database schema. The library also improves on the standard Perl MySQL database interfere package by providing auto-reconnect functionality and improved error handling.« less

A phantom study of the immobilization and the indications for using virtual isocenter in stereoscopic X‐ray image guidance system referring to position localizer in frameless radiosurgery

PubMed Central

Chang, Hsiao‐Han; Lee, Hsiao‐Fei; Sung, Chien‐Cheng; Liao, Tsung‐I

2013-01-01

A frameless radiosurgery system is using a set of thermoplastic mask for fixation and stereoscopic X‐ray imaging for alignment. The accuracy depends on mask fixation and imaging. Under certain circumstances, the guidance images may contain insufficient bony structures, resulting in lesser accuracy. A virtual isocenter function is designed for such scenarios. In this study, we investigated the immobilization and the indications for using virtual isocenter. Twenty‐four arbitrary imaginary treatment targets (ITTs) in phantom were evaluated. The external Localizer with positioner films was used as reference. The alignments by using actual and virtual isocenter in image guidance were compared. The deviation of the alignment after mask removing and then resetting was also checked. The results illustrated that the mean deviation between the alignment by image guidance using actual isocenter (Isoimg) and the localizer(Isoloc) was 2.26mm±1.16mm (standard deviation, SD), 1.66mm±0.83mm for using virtual isocenter. The deviation of the alignment by the image guidance using actual isocenter to the localizer before and after mask resetting was 7.02mm±5.8mm. The deviations before and after mask resetting were insignificant for the target center from skull edge larger than 80 mm on craniocaudal direction. The deviations between the alignment using actual and virtual isocenter in image guidance were not significant if the minimum distance from target center to skull edge was larger or equal to 30 mm. Due to an unacceptable deviation after mask resetting, the image guidance is necessary to improve the accuracy of frameless immobilization. A treatment isocenter less than 30 mm from the skull bone should be an indication for using virtual isocenter to align in image guidance. The virtual isocenter should be set as caudally as possible, and the sella of skull should be the ideal point. PACS numbers: 87.55.kh, 87.55.ne, 87.55.tm PMID:23835379

Parallel seed-based approach to multiple protein structure similarities detection

DOE PAGES

Chapuis, Guillaume; Le Boudic-Jamin, Mathilde; Andonov, Rumen; ...

2015-01-01

Finding similarities between protein structures is a crucial task in molecular biology. Most of the existing tools require proteins to be aligned in order-preserving way and only find single alignments even when multiple similar regions exist. We propose a new seed-based approach that discovers multiple pairs of similar regions. Its computational complexity is polynomial and it comes with a quality guarantee—the returned alignments have both root mean squared deviations (coordinate-based as well as internal-distances based) lower than a given threshold, if such exist. We do not require the alignments to be order preserving (i.e., we consider nonsequential alignments), which makesmore » our algorithm suitable for detecting similar domains when comparing multidomain proteins as well as to detect structural repetitions within a single protein. Because the search space for nonsequential alignments is much larger than for sequential ones, the computational burden is addressed by extensive use of parallel computing techniques: a coarse-grain level parallelism making use of available CPU cores for computation and a fine-grain level parallelism exploiting bit-level concurrency as well as vector instructions.« less

Probabilistic biological network alignment.

PubMed

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-01-01

Interactions between molecules are probabilistic events. An interaction may or may not happen with some probability, depending on a variety of factors such as the size, abundance, or proximity of the interacting molecules. In this paper, we consider the problem of aligning two biological networks. Unlike existing methods, we allow one of the two networks to contain probabilistic interactions. Allowing interaction probabilities makes the alignment more biologically relevant at the expense of explosive growth in the number of alternative topologies that may arise from different subsets of interactions that take place. We develop a novel method that efficiently and precisely characterizes this massive search space. We represent the topological similarity between pairs of aligned molecules (i.e., proteins) with the help of random variables and compute their expected values. We validate our method showing that, without sacrificing the running time performance, it can produce novel alignments. Our results also demonstrate that our method identifies biologically meaningful mappings under a comprehensive set of criteria used in the literature as well as the statistical coherence measure that we developed to analyze the statistical significance of the similarity of the functions of the aligned protein pairs.

A low-complexity add-on score for protein remote homology search with COMER.

PubMed

Margelevicius, Mindaugas

2018-06-15

Protein sequence alignment forms the basis for comparative modeling, the most reliable approach to protein structure prediction, among many other applications. Alignment between sequence families, or profile-profile alignment, represents one of the most, if not the most, sensitive means for homology detection but still necessitates improvement. We aim at improving the quality of profile-profile alignments and the sensitivity induced by them by refining profile-profile substitution scores. We have developed a new score that represents an additional component of profile-profile substitution scores. A comprehensive evaluation shows that the new add-on score statistically significantly improves both the sensitivity and the alignment quality of the COMER method. We discuss why the score leads to the improvement and its almost optimal computational complexity that makes it easily implementable in any profile-profile alignment method. An implementation of the add-on score in the open-source COMER software and data are available at https://sourceforge.net/projects/comer. The COMER software is also available on Github at https://github.com/minmarg/comer and as a Docker image (minmar/comer). Supplementary data are available at Bioinformatics online.

Discovering Sequence Motifs with Arbitrary Insertions and Deletions

PubMed Central

Frith, Martin C.; Saunders, Neil F. W.; Kobe, Bostjan; Bailey, Timothy L.

2008-01-01

Biology is encoded in molecular sequences: deciphering this encoding remains a grand scientific challenge. Functional regions of DNA, RNA, and protein sequences often exhibit characteristic but subtle motifs; thus, computational discovery of motifs in sequences is a fundamental and much-studied problem. However, most current algorithms do not allow for insertions or deletions (indels) within motifs, and the few that do have other limitations. We present a method, GLAM2 (Gapped Local Alignment of Motifs), for discovering motifs allowing indels in a fully general manner, and a companion method GLAM2SCAN for searching sequence databases using such motifs. glam2 is a generalization of the gapless Gibbs sampling algorithm. It re-discovers variable-width protein motifs from the PROSITE database significantly more accurately than the alternative methods PRATT and SAM-T2K. Furthermore, it usefully refines protein motifs from the ELM database: in some cases, the refined motifs make orders of magnitude fewer overpredictions than the original ELM regular expressions. GLAM2 performs respectably on the BAliBASE multiple alignment benchmark, and may be superior to leading multiple alignment methods for “motif-like” alignments with N- and C-terminal extensions. Finally, we demonstrate the use of GLAM2 to discover protein kinase substrate motifs and a gapped DNA motif for the LIM-only transcriptional regulatory complex: using GLAM2SCAN, we identify promising targets for the latter. GLAM2 is especially promising for short protein motifs, and it should improve our ability to identify the protein cleavage sites, interaction sites, post-translational modification attachment sites, etc., that underlie much of biology. It may be equally useful for arbitrarily gapped motifs in DNA and RNA, although fewer examples of such motifs are known at present. GLAM2 is public domain software, available for download at http://bioinformatics.org.au/glam2. PMID:18437229

Atomistic cluster alignment method for local order mining in liquids and glasses

NASA Astrophysics Data System (ADS)

Fang, X. W.; Wang, C. Z.; Yao, Y. X.; Ding, Z. J.; Ho, K. M.

2010-11-01

An atomistic cluster alignment method is developed to identify and characterize the local atomic structural order in liquids and glasses. With the “order mining” idea for structurally disordered systems, the method can detect the presence of any type of local order in the system and can quantify the structural similarity between a given set of templates and the aligned clusters in a systematic and unbiased manner. Moreover, population analysis can also be carried out for various types of clusters in the system. The advantages of the method in comparison with other previously developed analysis methods are illustrated by performing the structural analysis for four prototype systems (i.e., pure Al, pure Zr, Zr35Cu65 , and Zr36Ni64 ). The results show that the cluster alignment method can identify various types of short-range orders (SROs) in these systems correctly while some of these SROs are difficult to capture by most of the currently available analysis methods (e.g., Voronoi tessellation method). Such a full three-dimensional atomistic analysis method is generic and can be applied to describe the magnitude and nature of noncrystalline ordering in many disordered systems.

Evaluating the efficacy of a structure-derived amino acid substitution matrix in detecting protein homologs by BLAST and PSI-BLAST.

PubMed

Goonesekere, Nalin Cw

2009-01-01

The large numbers of protein sequences generated by whole genome sequencing projects require rapid and accurate methods of annotation. The detection of homology through computational sequence analysis is a powerful tool in determining the complex evolutionary and functional relationships that exist between proteins. Homology search algorithms employ amino acid substitution matrices to detect similarity between proteins sequences. The substitution matrices in common use today are constructed using sequences aligned without reference to protein structure. Here we present amino acid substitution matrices constructed from the alignment of a large number of protein domain structures from the structural classification of proteins (SCOP) database. We show that when incorporated into the homology search algorithms BLAST and PSI-blast, the structure-based substitution matrices enhance the efficacy of detecting remote homologs.

Analysing the performance of personal computers based on Intel microprocessors for sequence aligning bioinformatics applications.

PubMed

Nair, Pradeep S; John, Eugene B

2007-01-01

Aligning specific sequences against a very large number of other sequences is a central aspect of bioinformatics. With the widespread availability of personal computers in biology laboratories, sequence alignment is now often performed locally. This makes it necessary to analyse the performance of personal computers for sequence aligning bioinformatics benchmarks. In this paper, we analyse the performance of a personal computer for the popular BLAST and FASTA sequence alignment suites. Results indicate that these benchmarks have a large number of recurring operations and use memory operations extensively. It seems that the performance can be improved with a bigger L1-cache.

Factors driving physician-hospital alignment in orthopaedic surgery.

PubMed

Page, Alexandra E; Butler, Craig A; Bozic, Kevin J

2013-06-01

The relationships between physicians and hospitals are viewed as central to the proposition of delivering high-quality health care at a sustainable cost. Over the last two decades, major changes in the scope, breadth, and complexities of these relationships have emerged. Despite understanding the need for physician-hospital alignment, identification and understanding the incentives and drivers of alignment prove challenging. Our review identifies the primary drivers of physician alignment with hospitals from both the physician and hospital perspectives. Further, we assess the drivers more specific to motivating orthopaedic surgeons to align with hospitals. We performed a comprehensive literature review from 1992 to March 2012 to evaluate published studies and opinions on the issues surrounding physician-hospital alignment. Literature searches were performed in both MEDLINE(®) and Health Business™ Elite. Available literature identifies economic and regulatory shifts in health care and cultural factors as primary drivers of physician-hospital alignment. Specific to orthopaedics, factors driving alignment include the profitability of orthopaedic service lines, the expense of implants, and issues surrounding ambulatory surgery centers and other ancillary services. Evolving healthcare delivery and payment reforms promote increased collaboration between physicians and hospitals. While economic incentives and increasing regulatory demands provide the strongest drivers, cultural changes including physician leadership and changing expectations of work-life balance must be considered when pursuing successful alignment models. Physicians and hospitals view each other as critical to achieving lower-cost, higher-quality health care.

Searching for SNPs with cloud computing

PubMed Central

2009-01-01

As DNA sequencing outpaces improvements in computer speed, there is a critical need to accelerate tasks like alignment and SNP calling. Crossbow is a cloud-computing software tool that combines the aligner Bowtie and the SNP caller SOAPsnp. Executing in parallel using Hadoop, Crossbow analyzes data comprising 38-fold coverage of the human genome in three hours using a 320-CPU cluster rented from a cloud computing service for about $85. Crossbow is available from http://bowtie-bio.sourceforge.net/crossbow/. PMID:19930550

ChromA: signal-based retention time alignment for chromatography-mass spectrometry data.

PubMed

Hoffmann, Nils; Stoye, Jens

2009-08-15

We describe ChromA, a web-based alignment tool for chromatography-mass spectrometry data from the metabolomics and proteomics domains. Users can supply their data in open and standardized file formats for retention time alignment using dynamic time warping with different configurable local distance and similarity functions. Additionally, user-defined anchors can be used to constrain and speedup the alignment. A neighborhood around each anchor can be added to increase the flexibility of the constrained alignment. ChromA offers different visualizations of the alignment for easier qualitative interpretation and comparison of the data. For the multiple alignment of more than two data files, the center-star approximation is applied to select a reference among input files to align to. ChromA is available at http://bibiserv.techfak.uni-bielefeld.de/chroma. Executables and source code under the L-GPL v3 license are provided for download at the same location.

Motor–sensory convergence in object localization: a comparative study in rats and humans

PubMed Central

Horev, Guy; Saig, Avraham; Knutsen, Per Magne; Pietr, Maciej; Yu, Chunxiu; Ahissar, Ehud

2011-01-01

In order to identify basic aspects in the process of tactile perception, we trained rats and humans in similar object localization tasks and compared the strategies used by the two species. We found that rats integrated temporally related sensory inputs (‘temporal inputs’) from early whisk cycles with spatially related inputs (‘spatial inputs’) to align their whiskers with the objects; their perceptual reports appeared to be based primarily on this spatial alignment. In a similar manner, human subjects also integrated temporal and spatial inputs, but relied mainly on temporal inputs for object localization. These results suggest that during tactile object localization, an iterative motor–sensory process gradually converges on a stable percept of object location in both species. PMID:21969688

Scan for Motifs: a webserver for the analysis of post-transcriptional regulatory elements in the 3' untranslated regions (3' UTRs) of mRNAs.

PubMed

Biswas, Ambarish; Brown, Chris M

2014-06-08

Gene expression in vertebrate cells may be controlled post-transcriptionally through regulatory elements in mRNAs. These are usually located in the untranslated regions (UTRs) of mRNA sequences, particularly the 3'UTRs. Scan for Motifs (SFM) simplifies the process of identifying a wide range of regulatory elements on alignments of vertebrate 3'UTRs. SFM includes identification of both RNA Binding Protein (RBP) sites and targets of miRNAs. In addition to searching pre-computed alignments, the tool provides users the flexibility to search their own sequences or alignments. The regulatory elements may be filtered by expected value cutoffs and are cross-referenced back to their respective sources and literature. The output is an interactive graphical representation, highlighting potential regulatory elements and overlaps between them. The output also provides simple statistics and links to related resources for complementary analyses. The overall process is intuitive and fast. As SFM is a free web-application, the user does not need to install any software or databases. Visualisation of the binding sites of different classes of effectors that bind to 3'UTRs will facilitate the study of regulatory elements in 3' UTRs.

The VirusBanker database uses a Java program to allow flexible searching through Bunyaviridae sequences

PubMed Central

Fourment, Mathieu; Gibbs, Mark J

2008-01-01

Background Viruses of the Bunyaviridae have segmented negative-stranded RNA genomes and several of them cause significant disease. Many partial sequences have been obtained from the segments so that GenBank searches give complex results. Sequence databases usually use HTML pages to mediate remote sorting, but this approach can be limiting and may discourage a user from exploring a database. Results The VirusBanker database contains Bunyaviridae sequences and alignments and is presented as two spreadsheets generated by a Java program that interacts with a MySQL database on a server. Sequences are displayed in rows and may be sorted using information that is displayed in columns and includes data relating to the segment, gene, protein, species, strain, sequence length, terminal sequence and date and country of isolation. Bunyaviridae sequences and alignments may be downloaded from the second spreadsheet with titles defined by the user from the columns, or viewed when passed directly to the sequence editor, Jalview. Conclusion VirusBanker allows large datasets of aligned nucleotide and protein sequences from the Bunyaviridae to be compiled and winnowed rapidly using criteria that are formulated heuristically. PMID:18251994

Fast and accurate non-sequential protein structure alignment using a new asymmetric linear sum assignment heuristic.

PubMed

Brown, Peter; Pullan, Wayne; Yang, Yuedong; Zhou, Yaoqi

2016-02-01

The three dimensional tertiary structure of a protein at near atomic level resolution provides insight alluding to its function and evolution. As protein structure decides its functionality, similarity in structure usually implies similarity in function. As such, structure alignment techniques are often useful in the classifications of protein function. Given the rapidly growing rate of new, experimentally determined structures being made available from repositories such as the Protein Data Bank, fast and accurate computational structure comparison tools are required. This paper presents SPalignNS, a non-sequential protein structure alignment tool using a novel asymmetrical greedy search technique. The performance of SPalignNS was evaluated against existing sequential and non-sequential structure alignment methods by performing trials with commonly used datasets. These benchmark datasets used to gauge alignment accuracy include (i) 9538 pairwise alignments implied by the HOMSTRAD database of homologous proteins; (ii) a subset of 64 difficult alignments from set (i) that have low structure similarity; (iii) 199 pairwise alignments of proteins with similar structure but different topology; and (iv) a subset of 20 pairwise alignments from the RIPC set. SPalignNS is shown to achieve greater alignment accuracy (lower or comparable root-mean squared distance with increased structure overlap coverage) for all datasets, and the highest agreement with reference alignments from the challenging dataset (iv) above, when compared with both sequentially constrained alignments and other non-sequential alignments. SPalignNS was implemented in C++. The source code, binary executable, and a web server version is freely available at: http://sparks-lab.org yaoqi.zhou@griffith.edu.au. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Assessment of phylogenetic relationship of rare plant species collected from Saudi Arabia using internal transcribed spacer sequences of nuclear ribosomal DNA.

PubMed

Al-Qurainy, F; Khan, S; Nadeem, M; Tarroum, M; Alaklabi, A

2013-03-11

The rare and endangered plants of any country are important genetic resources that often require urgent conservation measures. Assessment of phylogenetic relationships and evaluation of genetic diversity is very important prior to implementation of conservation strategies for saving rare and endangered plant species. We used internal transcribed spacer sequences of nuclear ribosomal DNA for the evaluation of sequence identity from the available taxa in the GenBank database by using the Basic Local Alignment Search Tool (BLAST). Two rare plant species viz, Heliotropium strigosum claded with H. pilosum (98% branch support) and Pancratium tortuosum claded with P. tenuifolium (61% branch support) clearly. However, some species, viz Scadoxus multiflorus, Commiphora myrrha and Senecio hadiensis showed close relationships with more than one species. We conclude that nuclear ribosomal internal transcribed spacer sequences are useful markers for phylogenetic study of these rare plant species in Saudi Arabia.

Cloning and expression of N-glycosylation-related mannosidase from Glaciozyma antarctica for the production of a mannosynthase

NASA Astrophysics Data System (ADS)

Elangovan, Dharshini; Kamaruddin, Shazilah; Hashim, Noor Haza Fazlin; Bakar, Farah Diba Abu; Murad, Abd. Munir Abd.; Mahadi, Nor Muhammad; Allman, Sarah Ann; Mackeen, Mukram Mohamed

2016-11-01

The controlled synthesis of oligosaccharides is of growing interest due to the important roles of oligosaccharides in various biological processes. Enzymatic synthesis enables regio- and stereo-selective control during synthesis which still remains a challenge using total chemical synthesis. In this study, endoplasmic reticulum 1,2-α-mannosidase from Glaciozyma antractica was recombinantly expressed in Pichia pastoris. The gene sequence for ER mannosidase was obtained from the Glaciozyma antractica database. The BLAST (Basic Local Alignment Search Tool) results from bioinformatics screening showed that ER mannosidase had 41 % identity with the equivalent mannosidases from Sacchromyces cerevesiae. ER mannosidase from G. antartica was then cloned into the pPICZαC expression vector and used to transform in the host Pichia pastoris X33 cells. The ER mannosidase (MW˜58 kDa) was successfully expressed at 25 °C with 1.0 % methanol induction.

A Hough Transform Global Probabilistic Approach to Multiple-Subject Diffusion MRI Tractography

PubMed Central

Aganj, Iman; Lenglet, Christophe; Jahanshad, Neda; Yacoub, Essa; Harel, Noam; Thompson, Paul M.; Sapiro, Guillermo

2011-01-01

A global probabilistic fiber tracking approach based on the voting process provided by the Hough transform is introduced in this work. The proposed framework tests candidate 3D curves in the volume, assigning to each one a score computed from the diffusion images, and then selects the curves with the highest scores as the potential anatomical connections. The algorithm avoids local minima by performing an exhaustive search at the desired resolution. The technique is easily extended to multiple subjects, considering a single representative volume where the registered high-angular resolution diffusion images (HARDI) from all the subjects are non-linearly combined, thereby obtaining population-representative tracts. The tractography algorithm is run only once for the multiple subjects, and no tract alignment is necessary. We present experimental results on HARDI volumes, ranging from simulated and 1.5T physical phantoms to 7T and 4T human brain and 7T monkey brain datasets. PMID:21376655

Elusive treatment for human rhinosporidiosis.

PubMed

Janardhanan, Jeshina; Patole, Shalom; Varghese, Lalee; Rupa, V; Tirkey, Amit Jiwan; Varghese, George M

2016-07-01

The aim of this study was to clarify the contentious taxonomic classification of Rhinosporidium seeberi, the cause of human rhinosporidiosis, which may have treatment implications. PCR was used to amplify the internal transcribed spacer (ITS)-2 region from the genomic DNA of the aetiological agent obtained from a sample of human rhinosporidiosis lesions. The amplicon was sequenced and the organism identified using the Basic Local Alignment Search Tools (BLAST). Phylogenetic analysis revealed that the aetiological agent clustered along with the R. seeberi isolated from humans and also with Amphibiocystidium ranae from frogs. This organism is a member of the order Dermocystida in the class Mesomycetozoea. A patient with disseminated rhinosporidiosis did not respond to conventional therapy with dapsone and surgical excision, and treatment with amphotericin B also proved futile. An effective treatment for R. seeberi-a eukaryote belonging to the class Mesomycetozoea-is still elusive. Copyright © 2016. Published by Elsevier Ltd.

Data on the genome-wide identification of CNL R-genes in Setaria italica (L.) P. Beauv.

PubMed

Andersen, Ethan J; Nepal, Madhav P

2017-08-01

We report data associated with the identification of 242 disease resistance genes (R-genes) in the genome of Setaria italica as presented in "Genetic diversity of disease resistance genes in foxtail millet ( Setaria italica L.)" (Andersen and Nepal, 2017) [1]. Our data describe the structure and evolution of the Coiled-coil, Nucleotide-binding site, Leucine-rich repeat (CNL) R-genes in foxtail millet. The CNL genes were identified through rigorous extraction and analysis of recently available plant genome sequences using cutting-edge analytical software. Data visualization includes gene structure diagrams, chromosomal syntenic maps, a chromosomal density plot, and a maximum-likelihood phylogenetic tree comparing Sorghum bicolor , Panicum virgatum , Setaria italica , and Arabidopsis thaliana . Compilation of InterProScan annotations, Gene Ontology (GO) annotations, and Basic Local Alignment Search Tool (BLAST) results for the 242 R-genes identified in the foxtail millet genome are also included in tabular format.

Current data do not support routine use of patient-specific instrumentation in total knee arthroplasty.

PubMed

Voleti, Pramod B; Hamula, Mathew J; Baldwin, Keith D; Lee, Gwo-Chin

2014-09-01

The purpose of this systematic review and meta-analysis is to compare patient-specific instrumentation (PSI) versus standard instrumentation for total knee arthroplasty (TKA) with regard to coronal and sagittal alignment, operative time, intraoperative blood loss, and cost. A systematic query in search of relevant studies was performed, and the data published in these studies were extracted and aggregated. In regard to coronal alignment, PSI demonstrated improved accuracy in femorotibial angle (FTA) (P=0.0003), while standard instrumentation demonstrated improved accuracy in hip-knee-ankle angle (HKA) (P=0.02). Importantly, there were no differences between treatment groups in the percentages of FTA or HKA outliers (>3 degrees from target alignment) (P=0.7). Sagittal alignment, operative time, intraoperative blood loss, and cost were also similar between groups (P>0.1 for all comparisons). Copyright © 2014 Elsevier Inc. All rights reserved.

iPARTS2: an improved tool for pairwise alignment of RNA tertiary structures, version 2.

PubMed

Yang, Chung-Han; Shih, Cheng-Ting; Chen, Kun-Tze; Lee, Po-Han; Tsai, Ping-Han; Lin, Jian-Cheng; Yen, Ching-Yu; Lin, Tiao-Yin; Lu, Chin Lung

2016-07-08

Since its first release in 2010, iPARTS has become a valuable tool for globally or locally aligning two RNA 3D structures. It was implemented by a structural alphabet (SA)-based approach, which uses an SA of 23 letters to reduce RNA 3D structures into 1D sequences of SA letters and applies traditional sequence alignment to these SA-encoded sequences for determining their global or local similarity. In this version, we have re-implemented iPARTS into a new web server iPARTS2 by constructing a totally new SA, which consists of 92 elements with each carrying both information of base and backbone geometry for a representative nucleotide. This SA is significantly different from the one used in iPARTS, because the latter consists of only 23 elements with each carrying only the backbone geometry information of a representative nucleotide. Our experimental results have shown that iPARTS2 outperforms its previous version iPARTS and also achieves better accuracy than other popular tools, such as SARA, SETTER and RASS, in RNA alignment quality and function prediction. iPARTS2 takes as input two RNA 3D structures in the PDB format and outputs their global or local alignments with graphical display. iPARTS2 is now available online at http://genome.cs.nthu.edu.tw/iPARTS2/. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

Accelerating Information Retrieval from Profile Hidden Markov Model Databases.

PubMed

Tamimi, Ahmad; Ashhab, Yaqoub; Tamimi, Hashem

2016-01-01

Profile Hidden Markov Model (Profile-HMM) is an efficient statistical approach to represent protein families. Currently, several databases maintain valuable protein sequence information as profile-HMMs. There is an increasing interest to improve the efficiency of searching Profile-HMM databases to detect sequence-profile or profile-profile homology. However, most efforts to enhance searching efficiency have been focusing on improving the alignment algorithms. Although the performance of these algorithms is fairly acceptable, the growing size of these databases, as well as the increasing demand for using batch query searching approach, are strong motivations that call for further enhancement of information retrieval from profile-HMM databases. This work presents a heuristic method to accelerate the current profile-HMM homology searching approaches. The method works by cluster-based remodeling of the database to reduce the search space, rather than focusing on the alignment algorithms. Using different clustering techniques, 4284 TIGRFAMs profiles were clustered based on their similarities. A representative for each cluster was assigned. To enhance sensitivity, we proposed an extended step that allows overlapping among clusters. A validation benchmark of 6000 randomly selected protein sequences was used to query the clustered profiles. To evaluate the efficiency of our approach, speed and recall values were measured and compared with the sequential search approach. Using hierarchical, k-means, and connected component clustering techniques followed by the extended overlapping step, we obtained an average reduction in time of 41%, and an average recall of 96%. Our results demonstrate that representation of profile-HMMs using a clustering-based approach can significantly accelerate data retrieval from profile-HMM databases.

Unified Alignment of Protein-Protein Interaction Networks.

PubMed

Malod-Dognin, Noël; Ban, Kristina; Pržulj, Nataša

2017-04-19

Paralleling the increasing availability of protein-protein interaction (PPI) network data, several network alignment methods have been proposed. Network alignments have been used to uncover functionally conserved network parts and to transfer annotations. However, due to the computational intractability of the network alignment problem, aligners are heuristics providing divergent solutions and no consensus exists on a gold standard, or which scoring scheme should be used to evaluate them. We comprehensively evaluate the alignment scoring schemes and global network aligners on large scale PPI data and observe that three methods, HUBALIGN, L-GRAAL and NATALIE, regularly produce the most topologically and biologically coherent alignments. We study the collective behaviour of network aligners and observe that PPI networks are almost entirely aligned with a handful of aligners that we unify into a new tool, Ulign. Ulign enables complete alignment of two networks, which traditional global and local aligners fail to do. Also, multiple mappings of Ulign define biologically relevant soft clusterings of proteins in PPI networks, which may be used for refining the transfer of annotations across networks. Hence, PPI networks are already well investigated by current aligners, so to gain additional biological insights, a paradigm shift is needed. We propose such a shift come from aligning all available data types collectively rather than any particular data type in isolation from others.

Mapping local orientation of aligned fibrous scatterers for cancerous tissues using backscattering Mueller matrix imaging

NASA Astrophysics Data System (ADS)

He, Honghui; Sun, Minghao; Zeng, Nan; Du, E.; Liu, Shaoxiong; Guo, Yihong; Wu, Jian; He, Yonghong; Ma, Hui

2014-10-01

Polarization measurements are sensitive to the microstructure of tissues and can be used to detect pathological changes. Many tissues contain anisotropic fibrous structures. We obtain the local orientation of aligned fibrous scatterers using different groups of the backscattering Mueller matrix elements. Experiments on concentrically well-aligned silk fibers and unstained human papillary thyroid carcinoma tissues show that the m22, m33, m23, and m32 elements have better contrast but higher degeneracy for the extraction of orientation angles. The m12 and m13 elements show lower contrast, but allow us to determine the orientation angle for the fibrous scatterers along all directions. Moreover, Monte Carlo simulations based on the sphere-cylinder scattering model indicate that the oblique incidence of the illumination beam introduces some errors in the orientation angles obtained by both methods. Mapping the local orientation of anisotropic tissues may not only provide information on pathological changes, but can also give new leads to reduce the orientation dependence of polarization measurements.

Tuning the Spin-Alignment of Interstitial Electrons in Two-Dimensional Y2C Electride via Chemical Pressure.

PubMed

Park, Jongho; Hwang, Jae-Yeol; Lee, Kyu Hyoung; Kim, Seong-Gon; Lee, Kimoon; Kim, Sung Wng

2017-12-06

We report that the spin-alignment of interstitial anionic electrons (IAEs) in two-dimensional (2D) interlayer spacing can be tuned by chemical pressure that controls the magnetic properties of 2D electrides. It was clarified from the isovalent Sc substitution on the Y site in the 2D Y 2 C electride that the localization degree of IAEs at the interlayer becomes stronger as the unit cell volume and c-axis lattice parameter were systematically reduced by increasing the Sc contents, thus eventually enhancing superparamagnetic behavior originated from the increase in ferromagnetic particle concentration. It was also found that the spin-aligned localized IAEs dominated the electrical conduction of heavily Sc-substituted Y 2 C electride. These results indicate that the physcial properties of 2D electrides can be tailored by adjusting the localization of IAEs at interlayer spacing via structural modification that controls the spin instability as found in three-dimensional elemental electrides of pressurized potassium metals.

A simple grid implementation with Berkeley Open Infrastructure for Network Computing using BLAST as a model

PubMed Central

Pinthong, Watthanai; Muangruen, Panya

2016-01-01

Development of high-throughput technologies, such as Next-generation sequencing, allows thousands of experiments to be performed simultaneously while reducing resource requirement. Consequently, a massive amount of experiment data is now rapidly generated. Nevertheless, the data are not readily usable or meaningful until they are further analysed and interpreted. Due to the size of the data, a high performance computer (HPC) is required for the analysis and interpretation. However, the HPC is expensive and difficult to access. Other means were developed to allow researchers to acquire the power of HPC without a need to purchase and maintain one such as cloud computing services and grid computing system. In this study, we implemented grid computing in a computer training center environment using Berkeley Open Infrastructure for Network Computing (BOINC) as a job distributor and data manager combining all desktop computers to virtualize the HPC. Fifty desktop computers were used for setting up a grid system during the off-hours. In order to test the performance of the grid system, we adapted the Basic Local Alignment Search Tools (BLAST) to the BOINC system. Sequencing results from Illumina platform were aligned to the human genome database by BLAST on the grid system. The result and processing time were compared to those from a single desktop computer and HPC. The estimated durations of BLAST analysis for 4 million sequence reads on a desktop PC, HPC and the grid system were 568, 24 and 5 days, respectively. Thus, the grid implementation of BLAST by BOINC is an efficient alternative to the HPC for sequence alignment. The grid implementation by BOINC also helped tap unused computing resources during the off-hours and could be easily modified for other available bioinformatics software. PMID:27547555

Genetic Local Search for Optimum Multiuser Detection Problem in DS-CDMA Systems

NASA Astrophysics Data System (ADS)

Wang, Shaowei; Ji, Xiaoyong

Optimum multiuser detection (OMD) in direct-sequence code-division multiple access (DS-CDMA) systems is an NP-complete problem. In this paper, we present a genetic local search algorithm, which consists of an evolution strategy framework and a local improvement procedure. The evolution strategy searches the space of feasible, locally optimal solutions only. A fast iterated local search algorithm, which employs the proprietary characteristics of the OMD problem, produces local optima with great efficiency. Computer simulations show the bit error rate (BER) performance of the GLS outperforms other multiuser detectors in all cases discussed. The computation time is polynomial complexity in the number of users.

A Memetic Algorithm for Global Optimization of Multimodal Nonseparable Problems.

PubMed

Zhang, Geng; Li, Yangmin

2016-06-01

It is a big challenging issue of avoiding falling into local optimum especially when facing high-dimensional nonseparable problems where the interdependencies among vector elements are unknown. In order to improve the performance of optimization algorithm, a novel memetic algorithm (MA) called cooperative particle swarm optimizer-modified harmony search (CPSO-MHS) is proposed in this paper, where the CPSO is used for local search and the MHS for global search. The CPSO, as a local search method, uses 1-D swarm to search each dimension separately and thus converges fast. Besides, it can obtain global optimum elements according to our experimental results and analyses. MHS implements the global search by recombining different vector elements and extracting global optimum elements. The interaction between local search and global search creates a set of local search zones, where global optimum elements reside within the search space. The CPSO-MHS algorithm is tested and compared with seven other optimization algorithms on a set of 28 standard benchmarks. Meanwhile, some MAs are also compared according to the results derived directly from their corresponding references. The experimental results demonstrate a good performance of the proposed CPSO-MHS algorithm in solving multimodal nonseparable problems.

Automatic initialization for 3D bone registration

NASA Astrophysics Data System (ADS)

Foroughi, Pezhman; Taylor, Russell H.; Fichtinger, Gabor

2008-03-01

In image-guided bone surgery, sample points collected from the surface of the bone are registered to the preoperative CT model using well-known registration methods such as Iterative Closest Point (ICP). These techniques are generally very sensitive to the initial alignment of the datasets. Poor initialization significantly increases the chances of getting trapped local minima. In order to reduce the risk of local minima, the registration is manually initialized by locating the sample points close to the corresponding points on the CT model. In this paper, we present an automatic initialization method that aligns the sample points collected from the surface of pelvis with CT model of the pelvis. The main idea is to exploit a mean shape of pelvis created from a large number of CT scans as the prior knowledge to guide the initial alignment. The mean shape is constant for all registrations and facilitates the inclusion of application-specific information into the registration process. The CT model is first aligned with the mean shape using the bilateral symmetry of the pelvis and the similarity of multiple projections. The surface points collected using ultrasound are then aligned with the pelvis mean shape. This will, in turn, lead to initial alignment of the sample points with the CT model. The experiments using a dry pelvis and two cadavers show that the method can align the randomly dislocated datasets close enough for successful registration. The standard ICP has been used for final registration of datasets.

gmos: Rapid Detection of Genome Mosaicism over Short Evolutionary Distances.

PubMed

Domazet-Lošo, Mirjana; Domazet-Lošo, Tomislav

2016-01-01

Prokaryotic and viral genomes are often altered by recombination and horizontal gene transfer. The existing methods for detecting recombination are primarily aimed at viral genomes or sets of loci, since the expensive computation of underlying statistical models often hinders the comparison of complete prokaryotic genomes. As an alternative, alignment-free solutions are more efficient, but cannot map (align) a query to subject genomes. To address this problem, we have developed gmos (Genome MOsaic Structure), a new program that determines the mosaic structure of query genomes when compared to a set of closely related subject genomes. The program first computes local alignments between query and subject genomes and then reconstructs the query mosaic structure by choosing the best local alignment for each query region. To accomplish the analysis quickly, the program mostly relies on pairwise alignments and constructs multiple sequence alignments over short overlapping subject regions only when necessary. This fine-tuned implementation achieves an efficiency comparable to an alignment-free tool. The program performs well for simulated and real data sets of closely related genomes and can be used for fast recombination detection; for instance, when a new prokaryotic pathogen is discovered. As an example, gmos was used to detect genome mosaicism in a pathogenic Enterococcus faecium strain compared to seven closely related genomes. The analysis took less than two minutes on a single 2.1 GHz processor. The output is available in fasta format and can be visualized using an accessory program, gmosDraw (freely available with gmos).

gmos: Rapid Detection of Genome Mosaicism over Short Evolutionary Distances

PubMed Central

Domazet-Lošo, Mirjana; Domazet-Lošo, Tomislav

2016-01-01

Prokaryotic and viral genomes are often altered by recombination and horizontal gene transfer. The existing methods for detecting recombination are primarily aimed at viral genomes or sets of loci, since the expensive computation of underlying statistical models often hinders the comparison of complete prokaryotic genomes. As an alternative, alignment-free solutions are more efficient, but cannot map (align) a query to subject genomes. To address this problem, we have developed gmos (Genome MOsaic Structure), a new program that determines the mosaic structure of query genomes when compared to a set of closely related subject genomes. The program first computes local alignments between query and subject genomes and then reconstructs the query mosaic structure by choosing the best local alignment for each query region. To accomplish the analysis quickly, the program mostly relies on pairwise alignments and constructs multiple sequence alignments over short overlapping subject regions only when necessary. This fine-tuned implementation achieves an efficiency comparable to an alignment-free tool. The program performs well for simulated and real data sets of closely related genomes and can be used for fast recombination detection; for instance, when a new prokaryotic pathogen is discovered. As an example, gmos was used to detect genome mosaicism in a pathogenic Enterococcus faecium strain compared to seven closely related genomes. The analysis took less than two minutes on a single 2.1 GHz processor. The output is available in fasta format and can be visualized using an accessory program, gmosDraw (freely available with gmos). PMID:27846272

Search for signatures of magnetically-induced alignment in the arrival directions measured by the Pierre Auger Observatory

NASA Astrophysics Data System (ADS)

Pierre Auger Collaboration; Abreu, P.; Aglietta, M.; Ahn, E. J.; Albuquerque, I. F. M.; Allard, D.; Allekotte, I.; Allen, J.; Allison, P.; Alvarez Castillo, J.; Alvarez-Muñiz, J.; Ambrosio, M.; Aminaei, A.; Anchordoqui, L.; Andringa, S.; Antičić, T.; Anzalone, A.; Aramo, C.; Arganda, E.; Arqueros, F.; Asorey, H.; Assis, P.; Aublin, J.; Ave, M.; Avenier, M.; Avila, G.; Bäcker, T.; Balzer, M.; Barber, K. B.; Barbosa, A. F.; Bardenet, R.; Barroso, S. L. C.; Baughman, B.; Bäuml, J.; Beatty, J. J.; Becker, B. R.; Becker, K. H.; Bellétoile, A.; Bellido, J. A.; Benzvi, S.; Berat, C.; Bertou, X.; Biermann, P. L.; Billoir, P.; Blanco, F.; Blanco, M.; Bleve, C.; Blümer, H.; Boháčová, M.; Boncioli, D.; Bonifazi, C.; Bonino, R.; Borodai, N.; Brack, J.; Brogueira, P.; Brown, W. C.; Bruijn, R.; Buchholz, P.; Bueno, A.; Burton, R. E.; Caballero-Mora, K. S.; Caramete, L.; Caruso, R.; Castellina, A.; Catalano, O.; Cataldi, G.; Cazon, L.; Cester, R.; Chauvin, J.; Cheng, S. H.; Chiavassa, A.; Chinellato, J. A.; Chou, A.; Chudoba, J.; Clay, R. W.; Coluccia, M. R.; Conceição, R.; Contreras, F.; Cook, H.; Cooper, M. J.; Coppens, J.; Cordier, A.; Coutu, S.; Covault, C. E.; Creusot, A.; Criss, A.; Cronin, J.; Curutiu, A.; Dagoret-Campagne, S.; Dallier, R.; Dasso, S.; Daumiller, K.; Dawson, B. R.; de Almeida, R. M.; de Domenico, M.; de Donato, C.; de Jong, S. J.; de La Vega, G.; de Mello Junior, W. J. M.; de Mello Neto, J. R. T.; de Mitri, I.; de Souza, V.; de Vries, K. D.; Decerprit, G.; Del Peral, L.; Del Río, M.; Deligny, O.; Dembinski, H.; Dhital, N.; di Giulio, C.; Diaz, J. C.; Díaz Castro, M. L.; Diep, P. N.; Dobrigkeit, C.; Docters, W.; D'Olivo, J. C.; Dong, P. N.; Dorofeev, A.; Dos Anjos, J. C.; Dova, M. T.; D'Urso, D.; Dutan, I.; Ebr, J.; Engel, R.; Erdmann, M.; Escobar, C. O.; Espadanal, J.; Etchegoyen, A.; Facal San Luis, P.; Fajardo Tapia, I.; Falcke, H.; Farrar, G.; Fauth, A. C.; Fazzini, N.; Ferguson, A. P.; Ferrero, A.; Fick, B.; Filevich, A.; Filipčič, A.; Fliescher, S.; Fracchiolla, C. E.; Fraenkel, E. D.; Fröhlich, U.; Fuchs, B.; Gaior, R.; Gamarra, R. F.; Gambetta, S.; García, B.; García Gámez, D.; Garcia-Pinto, D.; Gascon, A.; Gemmeke, H.; Gesterling, K.; Ghia, P. L.; Giaccari, U.; Giller, M.; Glass, H.; Gold, M. S.; Golup, G.; Gomez Albarracin, F.; Gómez Berisso, M.; Gonçalves, P.; Gonzalez, D.; Gonzalez, J. G.; Gookin, B.; Góra, D.; Gorgi, A.; Gouffon, P.; Gozzini, S. R.; Grashorn, E.; Grebe, S.; Griffith, N.; Grigat, M.; Grillo, A. F.; Guardincerri, Y.; Guarino, F.; Guedes, G. P.; Guzman, A.; Hague, J. D.; Hansen, P.; Harari, D.; Harmsma, S.; Harton, J. L.; Haungs, A.; Hebbeker, T.; Heck, D.; Herve, A. E.; Hojvat, C.; Hollon, N.; Holmes, V. C.; Homola, P.; Hörandel, J. R.; Horneffer, A.; Hrabovský, M.; Huege, T.; Insolia, A.; Ionita, F.; Italiano, A.; Jarne, C.; Jiraskova, S.; Josebachuili, M.; Kadija, K.; Kampert, K. H.; Karhan, P.; Kasper, P.; Kégl, B.; Keilhauer, B.; Keivani, A.; Kelley, J. L.; Kemp, E.; Kieckhafer, R. M.; Klages, H. O.; Kleifges, M.; Kleinfeller, J.; Knapp, J.; Koang, D.-H.; Kotera, K.; Krohm, N.; Krömer, O.; Kruppke-Hansen, D.; Kuehn, F.; Kuempel, D.; Kulbartz, J. K.; Kunka, N.; La Rosa, G.; Lachaud, C.; Lautridou, P.; Leão, M. S. A. B.; Lebrun, D.; Lebrun, P.; Leigui de Oliveira, M. A.; Lemiere, A.; Letessier-Selvon, A.; Lhenry-Yvon, I.; Link, K.; López, R.; Lopez Agüera, A.; Louedec, K.; Lozano Bahilo, J.; Lu, L.; Lucero, A.; Ludwig, M.; Lyberis, H.; Maccarone, M. C.; Macolino, C.; Maldera, S.; Mandat, D.; Mantsch, P.; Mariazzi, A. G.; Marin, J.; Marin, V.; Maris, I. C.; Marquez Falcon, H. R.; Marsella, G.; Martello, D.; Martin, L.; Martinez, H.; Martínez Bravo, O.; Mathes, H. J.; Matthews, J.; Matthews, J. A. J.; Matthiae, G.; Maurizio, D.; Mazur, P. O.; Medina-Tanco, G.; Melissas, M.; Melo, D.; Menichetti, E.; Menshikov, A.; Mertsch, P.; Meurer, C.; Mićanović, S.; Micheletti, M. I.; Miller, W.; Miramonti, L.; Molina-Bueno, L.; Mollerach, S.; Monasor, M.; Monnier Ragaigne, D.; Montanet, F.; Morales, B.; Morello, C.; Moreno, E.; Moreno, J. C.; Morris, C.; Mostafá, M.; Moura, C. A.; Mueller, S.; Muller, M. A.; Müller, G.; Münchmeyer, M.; Mussa, R.; Navarra, G.; Navarro, J. L.; Navas, S.; Necesal, P.; Nellen, L.; Nelles, A.; Neuser, J.; Nhung, P. T.; Niemietz, L.; Nierstenhoefer, N.; Nitz, D.; Nosek, D.; Nožka, L.; Nyklicek, M.; Oehlschläger, J.; Olinto, A.; Oliva, P.; Olmos-Gilbaja, V. M.; Ortiz, M.; Pacheco, N.; Pakk Selmi-Dei, D.; Palatka, M.; Pallotta, J.; Palmieri, N.; Parente, G.; Parizot, E.; Parra, A.; Parsons, R. D.; Pastor, S.; Paul, T.; Pech, M.; PeĶala, J.; Pelayo, R.; Pepe, I. M.; Perrone, L.; Pesce, R.; Petermann, E.; Petrera, S.; Petrinca, P.; Petrolini, A.; Petrov, Y.; Petrovic, J.; Pfendner, C.; Phan, N.; Piegaia, R.; Pierog, T.; Pieroni, P.; Pimenta, M.; Pirronello, V.; Platino, M.; Ponce, V. H.; Pontz, M.; Privitera, P.; Prouza, M.; Quel, E. J.; Querchfeld, S.; Rautenberg, J.; Ravel, O.; Ravignani, D.; Revenu, B.; Ridky, J.; Riggi, S.; Risse, M.; Ristori, P.; Rivera, H.; Rizi, V.; Roberts, J.; Robledo, C.; Rodrigues de Carvalho, W.; Rodriguez, G.; Rodriguez Martino, J.; Rodriguez Rojo, J.; Rodriguez-Cabo, I.; Rodríguez-Frías, M. D.; Ros, G.; Rosado, J.; Rossler, T.; Roth, M.; Rouillé-D'Orfeuil, B.; Roulet, E.; Rovero, A. C.; Rühle, C.; Salamida, F.; Salazar, H.; Salina, G.; Sánchez, F.; Santo, C. E.; Santos, E.; Santos, E. M.; Sarazin, F.; Sarkar, B.; Sarkar, S.; Sato, R.; Scharf, N.; Scherini, V.; Schieler, H.; Schiffer, P.; Schmidt, A.; Schmidt, F.; Scholten, O.; Schoorlemmer, H.; Schovancova, J.; Schovánek, P.; Schröder, F.; Schulte, S.; Schuster, D.; Sciutto, S. J.; Scuderi, M.; Segreto, A.; Settimo, M.; Shadkam, A.; Shellard, R. C.; Sidelnik, I.; Sigl, G.; Silva Lopez, H. H.; Śmiałkowski, A.; Šmída, R.; Snow, G. R.; Sommers, P.; Sorokin, J.; Spinka, H.; Squartini, R.; Stanic, S.; Stapleton, J.; Stasielak, J.; Stephan, M.; Strazzeri, E.; Stutz, A.; Suarez, F.; Suomijärvi, T.; Supanitsky, A. D.; Šuša, T.; Sutherland, M. S.; Swain, J.; Szadkowski, Z.; Szuba, M.; Tamashiro, A.; Tapia, A.; Tartare, M.; Taşcău, O.; Tavera Ruiz, C. G.; Tcaciuc, R.; Tegolo, D.; Thao, N. T.; Thomas, D.; Tiffenberg, J.; Timmermans, C.; Tiwari, D. K.; Tkaczyk, W.; Todero Peixoto, C. J.; Tomé, B.; Tonachini, A.; Travnicek, P.; Tridapalli, D. B.; Tristram, G.; Trovato, E.; Tueros, M.; Ulrich, R.; Unger, M.; Urban, M.; Valdés Galicia, J. F.; Valiño, I.; Valore, L.; van den Berg, A. M.; Varela, E.; Vargas Cárdenas, B.; Vázquez, J. R.; Vázquez, R. A.; Veberič, D.; Verzi, V.; Vicha, J.; Videla, M.; Villaseñor, L.; Wahlberg, H.; Wahrlich, P.; Wainberg, O.; Walz, D.; Warner, D.; Watson, A. A.; Weber, M.; Weidenhaupt, K.; Weindl, A.; Westerhoff, S.; Whelan, B. J.; Wieczorek, G.; Wiencke, L.; Wilczyńska, B.; Wilczyński, H.; Will, M.; Williams, C.; Winchen, T.; Winnick, M. G.; Wommer, M.; Wundheiler, B.; Yamamoto, T.; Yapici, T.; Younk, P.; Yuan, G.; Yushkov, A.; Zamorano, B.; Zas, E.; Zavrtanik, D.; Zavrtanik, M.; Zaw, I.; Zepeda, A.; Zimbres Silva, M.; Ziolkowski, M.

2012-01-01

We present the results of an analysis of data recorded at the Pierre Auger Observatory in which we search for groups of directionally-aligned events (or 'multiplets') which exhibit a correlation between arrival direction and the inverse of the energy. These signatures are expected from sets of events coming from the same source after having been deflected by intervening coherent magnetic fields. The observation of several events from the same source would open the possibility to accurately reconstruct the position of the source and also measure the integral of the component of the magnetic field orthogonal to the trajectory of the cosmic rays. We describe the largest multiplets found and compute the probability that they appeared by chance from an isotropic distribution. We find no statistically significant evidence for the presence of multiplets arising from magnetic deflections in the present data.

Search for signatures of magnetically-induced alignment in the arrival directions measured by the Pierre Auger Observatory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Abreu, P.; /Lisbon, IST; Aglietta, M.

2011-11-01

We present the results of an analysis of data recorded at the Pierre Auger Observatory in which we search for groups of directionally-aligned events (or ''multiplets'') which exhibit a correlation between arrival direction and the inverse of the energy. These signatures are expected from sets of events coming from the same source after having been deflected by intervening coherent magnetic fields. The observation of several events from the same source would open the possibility to accurately reconstruct the position of the source and also measure the integral of the component of the magnetic field orthogonal to the trajectory of themore » cosmic rays. We describe the largest multiplets found and compute the probability that they appeared by chance from an isotropic distribution. We find no statistically significant evidence for the presence of multiplets arising from magnetic deflections in the present data.« less

PARTS: Probabilistic Alignment for RNA joinT Secondary structure prediction

PubMed Central

Harmanci, Arif Ozgun; Sharma, Gaurav; Mathews, David H.

2008-01-01

A novel method is presented for joint prediction of alignment and common secondary structures of two RNA sequences. The joint consideration of common secondary structures and alignment is accomplished by structural alignment over a search space defined by the newly introduced motif called matched helical regions. The matched helical region formulation generalizes previously employed constraints for structural alignment and thereby better accommodates the structural variability within RNA families. A probabilistic model based on pseudo free energies obtained from precomputed base pairing and alignment probabilities is utilized for scoring structural alignments. Maximum a posteriori (MAP) common secondary structures, sequence alignment and joint posterior probabilities of base pairing are obtained from the model via a dynamic programming algorithm called PARTS. The advantage of the more general structural alignment of PARTS is seen in secondary structure predictions for the RNase P family. For this family, the PARTS MAP predictions of secondary structures and alignment perform significantly better than prior methods that utilize a more restrictive structural alignment model. For the tRNA and 5S rRNA families, the richer structural alignment model of PARTS does not offer a benefit and the method therefore performs comparably with existing alternatives. For all RNA families studied, the posterior probability estimates obtained from PARTS offer an improvement over posterior probability estimates from a single sequence prediction. When considering the base pairings predicted over a threshold value of confidence, the combination of sensitivity and positive predictive value is superior for PARTS than for the single sequence prediction. PARTS source code is available for download under the GNU public license at http://rna.urmc.rochester.edu. PMID:18304945

Energy level alignment at molecule-metal interfaces from an optimally tuned range-separated hybrid functional

DOE PAGES

Liu, Zhen-Fei; Egger, David A.; Refaely-Abramson, Sivan; ...

2017-02-21

The alignment of the frontier orbital energies of an adsorbed molecule with the substrate Fermi level at metal-organic interfaces is a fundamental observable of significant practical importance in nanoscience and beyond. Typical density functional theory calculations, especially those using local and semi-local functionals, often underestimate level alignment leading to inaccurate electronic structure and charge transport properties. Here, we develop a new fully self-consistent predictive scheme to accurately compute level alignment at certain classes of complex heterogeneous molecule-metal interfaces based on optimally tuned range-separated hybrid functionals. Starting from a highly accurate description of the gas-phase electronic structure, our method by constructionmore » captures important nonlocal surface polarization effects via tuning of the long-range screened exchange in a range-separated hybrid in a non-empirical and system-specific manner. We implement this functional in a plane-wave code and apply it to several physisorbed and chemisorbed molecule-metal interface systems. Our results are in quantitative agreement with experiments, the both the level alignment and work function changes. This approach constitutes a new practical scheme for accurate and efficient calculations of the electronic structure of molecule-metal interfaces.« less

Energy level alignment at molecule-metal interfaces from an optimally tuned range-separated hybrid functional

NASA Astrophysics Data System (ADS)

Liu, Zhen-Fei; Egger, David A.; Refaely-Abramson, Sivan; Kronik, Leeor; Neaton, Jeffrey B.

2017-03-01

The alignment of the frontier orbital energies of an adsorbed molecule with the substrate Fermi level at metal-organic interfaces is a fundamental observable of significant practical importance in nanoscience and beyond. Typical density functional theory calculations, especially those using local and semi-local functionals, often underestimate level alignment leading to inaccurate electronic structure and charge transport properties. In this work, we develop a new fully self-consistent predictive scheme to accurately compute level alignment at certain classes of complex heterogeneous molecule-metal interfaces based on optimally tuned range-separated hybrid functionals. Starting from a highly accurate description of the gas-phase electronic structure, our method by construction captures important nonlocal surface polarization effects via tuning of the long-range screened exchange in a range-separated hybrid in a non-empirical and system-specific manner. We implement this functional in a plane-wave code and apply it to several physisorbed and chemisorbed molecule-metal interface systems. Our results are in quantitative agreement with experiments, the both the level alignment and work function changes. Our approach constitutes a new practical scheme for accurate and efficient calculations of the electronic structure of molecule-metal interfaces.

Field gradients can control the alignment of nanorods.

PubMed

Ooi, Chinchun; Yellen, Benjamin B

2008-08-19

This work is motivated by the unexpected experimental observation that field gradients can control the alignment of nonmagnetic nanorods immersed inside magnetic fluids. In the presence of local field gradients, nanorods were observed to align perpendicular to the external field at low field strengths, but parallel to the external field at high field strengths. The switching behavior results from the competition between a preference to align with the external field (orientational potential energy) and preference to move into regions of minimum magnetic field (positional potential energy). A theoretical model is developed to explain this experimental behavior by investigating the statistics of nanorod alignment as a function of both the external uniform magnetic field strength and the local magnetic field variation above a periodic array of micromagnets. Computational phase diagrams are developed which indicate that the relative population of nanorods in parallel and perpendicular states can be adjusted through several control parameters. However, an energy barrier to rotation was discovered to influence the rate kinetics and restrict the utility of this assembly technique to nanorods which are slightly shorter than the micromagnet length. Experimental results concerning the orientation of nanorods inside magnetic fluid are also presented and shown to be in strong agreement with the theoretical work.

AntiClustal: Multiple Sequence Alignment by antipole clustering and linear approximate 1-median computation.

PubMed

Di Pietro, C; Di Pietro, V; Emmanuele, G; Ferro, A; Maugeri, T; Modica, E; Pigola, G; Pulvirenti, A; Purrello, M; Ragusa, M; Scalia, M; Shasha, D; Travali, S; Zimmitti, V

2003-01-01

In this paper we present a new Multiple Sequence Alignment (MSA) algorithm called AntiClusAl. The method makes use of the commonly use idea of aligning homologous sequences belonging to classes generated by some clustering algorithm, and then continue the alignment process ina bottom-up way along a suitable tree structure. The final result is then read at the root of the tree. Multiple sequence alignment in each cluster makes use of the progressive alignment with the 1-median (center) of the cluster. The 1-median of set S of sequences is the element of S which minimizes the average distance from any other sequence in S. Its exact computation requires quadratic time. The basic idea of our proposed algorithm is to make use of a simple and natural algorithmic technique based on randomized tournaments which has been successfully applied to large size search problems in general metric spaces. In particular a clustering algorithm called Antipole tree and an approximate linear 1-median computation are used. Our algorithm compared with Clustal W, a widely used tool to MSA, shows a better running time results with fully comparable alignment quality. A successful biological application showing high aminoacid conservation during evolution of Xenopus laevis SOD2 is also cited.

Development and Demonstration of a Networked Telepathology 3-D Imaging, Databasing, and Communication System

DTIC Science & Technology

1996-10-01

aligned using an octree search algorithm combined with cross correlation analysis . Successive 4x downsampling with optional and specifiable neighborhood...desired and the search engine embedded in the OODBMS will find the requested imagery and que it to the user for further analysis . This application was...obtained during Hoftmann-LaRoche production pathology imaging performed at UMICH. Versant works well and is easy to use; 3) Pathology Image Analysis

mRAISE: an alternative algorithmic approach to ligand-based virtual screening

NASA Astrophysics Data System (ADS)

von Behren, Mathias M.; Bietz, Stefan; Nittinger, Eva; Rarey, Matthias

2016-08-01

Ligand-based virtual screening is a well established method to find new lead molecules in todays drug discovery process. In order to be applicable in day to day practice, such methods have to face multiple challenges. The most important part is the reliability of the results, which can be shown and compared in retrospective studies. Furthermore, in the case of 3D methods, they need to provide biologically relevant molecular alignments of the ligands, that can be further investigated by a medicinal chemist. Last but not least, they have to be able to screen large databases in reasonable time. Many algorithms for ligand-based virtual screening have been proposed in the past, most of them based on pairwise comparisons. Here, a new method is introduced called mRAISE. Based on structural alignments, it uses a descriptor-based bitmap search engine (RAISE) to achieve efficiency. Alignments created on the fly by the search engine get evaluated with an independent shape-based scoring function also used for ranking of compounds. The correct ranking as well as the alignment quality of the method are evaluated and compared to other state of the art methods. On the commonly used Directory of Useful Decoys dataset mRAISE achieves an average area under the ROC curve of 0.76, an average enrichment factor at 1 % of 20.2 and an average hit rate at 1 % of 55.5. With these results, mRAISE is always among the top performing methods with available data for comparison. To access the quality of the alignments calculated by ligand-based virtual screening methods, we introduce a new dataset containing 180 prealigned ligands for 11 diverse targets. Within the top ten ranked conformations, the alignment closest to X-ray structure calculated with mRAISE has a root-mean-square deviation of less than 2.0 Å for 80.8 % of alignment pairs and achieves a median of less than 2.0 Å for eight of the 11 cases. The dataset used to rate the quality of the calculated alignments is freely available at http://www.zbh.uni-hamburg.de/mraise-dataset.html. The table of all PDB codes contained in the ensembles can be found in the supplementary material. The software tool mRAISE is freely available for evaluation purposes and academic use (see http://www.zbh.uni-hamburg.de/raise).

Fast and accurate reference-free alignment of subtomograms.

PubMed

Chen, Yuxiang; Pfeffer, Stefan; Hrabe, Thomas; Schuller, Jan Michael; Förster, Friedrich

2013-06-01

In cryoelectron tomography alignment and averaging of subtomograms, each dnepicting the same macromolecule, improves the resolution compared to the individual subtomogram. Major challenges of subtomogram alignment are noise enhancement due to overfitting, the bias of an initial reference in the iterative alignment process, and the computational cost of processing increasingly large amounts of data. Here, we propose an efficient and accurate alignment algorithm via a generalized convolution theorem, which allows computation of a constrained correlation function using spherical harmonics. This formulation increases computational speed of rotational matching dramatically compared to rotation search in Cartesian space without sacrificing accuracy in contrast to other spherical harmonic based approaches. Using this sampling method, a reference-free alignment procedure is proposed to tackle reference bias and overfitting, which also includes contrast transfer function correction by Wiener filtering. Application of the method to simulated data allowed us to obtain resolutions near the ground truth. For two experimental datasets, ribosomes from yeast lysate and purified 20S proteasomes, we achieved reconstructions of approximately 20Å and 16Å, respectively. The software is ready-to-use and made public to the community. Copyright © 2013 Elsevier Inc. All rights reserved.

LS-align: an atom-level, flexible ligand structural alignment algorithm for high-throughput virtual screening.

PubMed

Hu, Jun; Liu, Zi; Yu, Dong-Jun; Zhang, Yang

2018-02-15

Sequence-order independent structural comparison, also called structural alignment, of small ligand molecules is often needed for computer-aided virtual drug screening. Although many ligand structure alignment programs are proposed, most of them build the alignments based on rigid-body shape comparison which cannot provide atom-specific alignment information nor allow structural variation; both abilities are critical to efficient high-throughput virtual screening. We propose a novel ligand comparison algorithm, LS-align, to generate fast and accurate atom-level structural alignments of ligand molecules, through an iterative heuristic search of the target function that combines inter-atom distance with mass and chemical bond comparisons. LS-align contains two modules of Rigid-LS-align and Flexi-LS-align, designed for rigid-body and flexible alignments, respectively, where a ligand-size independent, statistics-based scoring function is developed to evaluate the similarity of ligand molecules relative to random ligand pairs. Large-scale benchmark tests are performed on prioritizing chemical ligands of 102 protein targets involving 1,415,871 candidate compounds from the DUD-E (Database of Useful Decoys: Enhanced) database, where LS-align achieves an average enrichment factor (EF) of 22.0 at the 1% cutoff and the AUC score of 0.75, which are significantly higher than other state-of-the-art methods. Detailed data analyses show that the advanced performance is mainly attributed to the design of the target function that combines structural and chemical information to enhance the sensitivity of recognizing subtle difference of ligand molecules and the introduces of structural flexibility that help capture the conformational changes induced by the ligand-receptor binding interactions. These data demonstrate a new avenue to improve the virtual screening efficiency through the development of sensitive ligand structural alignments. http://zhanglab.ccmb.med.umich.edu/LS-align/. njyudj@njust.edu.cn or zhng@umich.edu. Supplementary data are available at Bioinformatics online.

The chordate proteome history database.

PubMed

Levasseur, Anthony; Paganini, Julien; Dainat, Jacques; Thompson, Julie D; Poch, Olivier; Pontarotti, Pierre; Gouret, Philippe

2012-01-01

The chordate proteome history database (http://ioda.univ-provence.fr) comprises some 20,000 evolutionary analyses of proteins from chordate species. Our main objective was to characterize and study the evolutionary histories of the chordate proteome, and in particular to detect genomic events and automatic functional searches. Firstly, phylogenetic analyses based on high quality multiple sequence alignments and a robust phylogenetic pipeline were performed for the whole protein and for each individual domain. Novel approaches were developed to identify orthologs/paralogs, and predict gene duplication/gain/loss events and the occurrence of new protein architectures (domain gains, losses and shuffling). These important genetic events were localized on the phylogenetic trees and on the genomic sequence. Secondly, the phylogenetic trees were enhanced by the creation of phylogroups, whereby groups of orthologous sequences created using OrthoMCL were corrected based on the phylogenetic trees; gene family size and gene gain/loss in a given lineage could be deduced from the phylogroups. For each ortholog group obtained from the phylogenetic or the phylogroup analysis, functional information and expression data can be retrieved. Database searches can be performed easily using biological objects: protein identifier, keyword or domain, but can also be based on events, eg, domain exchange events can be retrieved. To our knowledge, this is the first database that links group clustering, phylogeny and automatic functional searches along with the detection of important events occurring during genome evolution, such as the appearance of a new domain architecture.

Automated discovery of local search heuristics for satisfiability testing.

PubMed

Fukunaga, Alex S

2008-01-01

The development of successful metaheuristic algorithms such as local search for a difficult problem such as satisfiability testing (SAT) is a challenging task. We investigate an evolutionary approach to automating the discovery of new local search heuristics for SAT. We show that several well-known SAT local search algorithms such as Walksat and Novelty are composite heuristics that are derived from novel combinations of a set of building blocks. Based on this observation, we developed CLASS, a genetic programming system that uses a simple composition operator to automatically discover SAT local search heuristics. New heuristics discovered by CLASS are shown to be competitive with the best Walksat variants, including Novelty+. Evolutionary algorithms have previously been applied to directly evolve a solution for a particular SAT instance. We show that the heuristics discovered by CLASS are also competitive with these previous, direct evolutionary approaches for SAT. We also analyze the local search behavior of the learned heuristics using the depth, mobility, and coverage metrics proposed by Schuurmans and Southey.

ChromA: signal-based retention time alignment for chromatography–mass spectrometry data

PubMed Central

Hoffmann, Nils; Stoye, Jens

2009-01-01

Summary: We describe ChromA, a web-based alignment tool for chromatography–mass spectrometry data from the metabolomics and proteomics domains. Users can supply their data in open and standardized file formats for retention time alignment using dynamic time warping with different configurable local distance and similarity functions. Additionally, user-defined anchors can be used to constrain and speedup the alignment. A neighborhood around each anchor can be added to increase the flexibility of the constrained alignment. ChromA offers different visualizations of the alignment for easier qualitative interpretation and comparison of the data. For the multiple alignment of more than two data files, the center-star approximation is applied to select a reference among input files to align to. Availability: ChromA is available at http://bibiserv.techfak.uni-bielefeld.de/chroma. Executables and source code under the L-GPL v3 license are provided for download at the same location. Contact: stoye@techfak.uni-bielefeld.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:19505941

Structure based alignment and clustering of proteins (STRALCP)

DOEpatents

Zemla, Adam T.; Zhou, Carol E.; Smith, Jason R.; Lam, Marisa W.

2013-06-18

Disclosed are computational methods of clustering a set of protein structures based on local and pair-wise global similarity values. Pair-wise local and global similarity values are generated based on pair-wise structural alignments for each protein in the set of protein structures. Initially, the protein structures are clustered based on pair-wise local similarity values. The protein structures are then clustered based on pair-wise global similarity values. For each given cluster both a representative structure and spans of conserved residues are identified. The representative protein structure is used to assign newly-solved protein structures to a group. The spans are used to characterize conservation and assign a "structural footprint" to the cluster.

Dependence of field-aligned electron precipitation on season, altitude and pitch angle

NASA Technical Reports Server (NTRS)

Berko, F. W.; Hoffman, R. A.

1973-01-01

The occurrence of field-aligned 2.3 keV electron precipitation was examined by using data from more than 7500 orbits of the polar-orbiting satellite, OGO-4. The frequency of occurrence of field aligned precipitation was highest at actual pitch angles between 7 and 10 deg, being highest in the winter months, at highest satellite altitudes. Acceleration by a localized parallel electric field established by electrostatic charge layers is proposed to explain particle observations.

On the orientation of the backbone dipoles in native folds

PubMed Central

Ripoll, Daniel R.; Vila, Jorge A.; Scheraga, Harold A.

2005-01-01

The role of electrostatic interactions in determining the native fold of proteins has been investigated by analyzing the alignment of peptide bond dipole moments with the local electrostatic field generated by the rest of the molecule with and without solvent effects. This alignment was calculated for a set of 112 native proteins by using charges from a gas phase potential. Most of the peptide dipoles in this set of proteins are on average aligned with the electrostatic field. The dipole moments associated with α-helical conformations show the best alignment with the electrostatic field, followed by residues in β-strand conformations. The dipole moments associated with other secondary structure elements are on average better aligned than in randomly generated conformations. The alignment of a dipole with the local electrostatic field depends on both the topology of the native fold and the charge distribution assumed for all of the residues. The influences of (i) solvent effects, (ii) different sets of charges, and (iii) the charge distribution assumed for the whole molecule were examined with a subset of 22 proteins each of which contains <30 ionizable groups. The results show that alternative charge distribution models lead to significant differences among the associated electrostatic fields, whereas the electrostatic field is less sensitive to the particular set of the adopted charges themselves (empirical conformational energy program for peptides or parameters for solvation energy). PMID:15894608

Does Test Item Performance Increase with Test-to-Standards Alignment?

ERIC Educational Resources Information Center

Traynor, Anne

2017-01-01

Variation in test performance among examinees from different regions or national jurisdictions is often partially attributed to differences in the degree of content correspondence between local school or training program curricula, and the test of interest. This posited relationship between test-curriculum correspondence, or "alignment,"…

A global optimization algorithm for protein surface alignment

PubMed Central

2010-01-01

Background A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined with physico-chemical properties of the site since the conformation, size and chemical composition of the protein surface are all relevant for the interaction with a specific ligand. Several matching strategies have been designed for the recognition of protein-ligand binding sites and of protein-protein interfaces but the problem cannot be considered solved. Results In this paper we propose a new method for local structural alignment of protein surfaces based on continuous global optimization techniques. Given the three-dimensional structures of two proteins, the method finds the isometric transformation (rotation plus translation) that best superimposes active regions of two structures. We draw our inspiration from the well-known Iterative Closest Point (ICP) method for three-dimensional (3D) shapes registration. Our main contribution is in the adoption of a controlled random search as a more efficient global optimization approach along with a new dissimilarity measure. The reported computational experience and comparison show viability of the proposed approach. Conclusions Our method performs well to detect similarity in binding sites when this in fact exists. In the future we plan to do a more comprehensive evaluation of the method by considering large datasets of non-redundant proteins and applying a clustering technique to the results of all comparisons to classify binding sites. PMID:20920230

Learning Receptive Fields and Quality Lookups for Blind Quality Assessment of Stereoscopic Images.

PubMed

Shao, Feng; Lin, Weisi; Wang, Shanshan; Jiang, Gangyi; Yu, Mei; Dai, Qionghai

2016-03-01

Blind quality assessment of 3D images encounters more new challenges than its 2D counterparts. In this paper, we propose a blind quality assessment for stereoscopic images by learning the characteristics of receptive fields (RFs) from perspective of dictionary learning, and constructing quality lookups to replace human opinion scores without performance loss. The important feature of the proposed method is that we do not need a large set of samples of distorted stereoscopic images and the corresponding human opinion scores to learn a regression model. To be more specific, in the training phase, we learn local RFs (LRFs) and global RFs (GRFs) from the reference and distorted stereoscopic images, respectively, and construct their corresponding local quality lookups (LQLs) and global quality lookups (GQLs). In the testing phase, blind quality pooling can be easily achieved by searching optimal GRF and LRF indexes from the learnt LQLs and GQLs, and the quality score is obtained by combining the LRF and GRF indexes together. Experimental results on three publicly 3D image quality assessment databases demonstrate that in comparison with the existing methods, the devised algorithm achieves high consistent alignment with subjective assessment.

ASGARD: an open-access database of annotated transcriptomes for emerging model arthropod species.

PubMed

Zeng, Victor; Extavour, Cassandra G

2012-01-01

The increased throughput and decreased cost of next-generation sequencing (NGS) have shifted the bottleneck genomic research from sequencing to annotation, analysis and accessibility. This is particularly challenging for research communities working on organisms that lack the basic infrastructure of a sequenced genome, or an efficient way to utilize whatever sequence data may be available. Here we present a new database, the Assembled Searchable Giant Arthropod Read Database (ASGARD). This database is a repository and search engine for transcriptomic data from arthropods that are of high interest to multiple research communities but currently lack sequenced genomes. We demonstrate the functionality and utility of ASGARD using de novo assembled transcriptomes from the milkweed bug Oncopeltus fasciatus, the cricket Gryllus bimaculatus and the amphipod crustacean Parhyale hawaiensis. We have annotated these transcriptomes to assign putative orthology, coding region determination, protein domain identification and Gene Ontology (GO) term annotation to all possible assembly products. ASGARD allows users to search all assemblies by orthology annotation, GO term annotation or Basic Local Alignment Search Tool. User-friendly features of ASGARD include search term auto-completion suggestions based on database content, the ability to download assembly product sequences in FASTA format, direct links to NCBI data for predicted orthologs and graphical representation of the location of protein domains and matches to similar sequences from the NCBI non-redundant database. ASGARD will be a useful repository for transcriptome data from future NGS studies on these and other emerging model arthropods, regardless of sequencing platform, assembly or annotation status. This database thus provides easy, one-stop access to multi-species annotated transcriptome information. We anticipate that this database will be useful for members of multiple research communities, including developmental biology, physiology, evolutionary biology, ecology, comparative genomics and phylogenomics. Database URL: asgard.rc.fas.harvard.edu.

A Search for FRB 121102-like Persistent Radio-luminous Sources—Candidates and Implications for the FRB Rate and Searches

NASA Astrophysics Data System (ADS)

Ofek, Eran O.

2017-09-01

The localization of the repeating fast radio burst (FRB), FRB 121102, suggests that it is associated with a persistent radio-luminous compact source in the FRB host galaxy. Using the FIRST radio catalog, I present a search for luminous persistent sources in nearby galaxies, with radio luminosities > 10 % of the FRB 121102 persistent source luminosity. The galaxy sample contains about 30% of the total galaxy g-band luminosity within < 108 Mpc, in a footprint of 10,600 deg2. After rejecting sources likely due to active galactic nuclei activity or background sources, I am left with 11 candidates that are presumably associated with galactic disks or star-formation regions. At least some of these candidates are likely to be due to chance alignment. In addition, I find 85 sources within 1\\prime\\prime of galactic nuclei. Assuming that the radio persistent sources are not related to galactic nuclei and that they follow the galaxy g-band light, the 11 sources imply a 95% confidence upper limit on the space density of luminous persistent sources of ≲ 5× {10}-5 Mpc-3, and that at any given time only a small fraction of galaxies host a radio-luminous persistent source (≲ {10}-3 {L}* -1). Assuming a persistent source lifetime of 100 years, this implies a birth rate of ≲ 5× {10}-7 yr-1 Mpc-3. Given the FRB volumetric rate, and assuming that all FRBs repeat and are associated with persistent radio sources, this sets a lower limit on the rate of FRB events per persistent source of ≳ 0.8 yr-1. I argue that these 11 candidates are good targets for FRB searches and I estimate the FRB event rate from these candidates.

Foraging patterns in online searches.

PubMed

Wang, Xiangwen; Pleimling, Michel

2017-03-01

Nowadays online searches are undeniably the most common form of information gathering, as witnessed by billions of clicks generated each day on search engines. In this work we describe online searches as foraging processes that take place on the semi-infinite line. Using a variety of quantities like probability distributions and complementary cumulative distribution functions of step length and waiting time as well as mean square displacements and entropies, we analyze three different click-through logs that contain the detailed information of millions of queries submitted to search engines. Notable differences between the different logs reveal an increased efficiency of the search engines. In the language of foraging, the newer logs indicate that online searches overwhelmingly yield local searches (i.e., on one page of links provided by the search engines), whereas for the older logs the foraging processes are a combination of local searches and relocation phases that are power law distributed. Our investigation of click logs of search engines therefore highlights the presence of intermittent search processes (where phases of local explorations are separated by power law distributed relocation jumps) in online searches. It follows that good search engines enable the users to find the information they are looking for through a local exploration of a single page with search results, whereas for poor search engine users are often forced to do a broader exploration of different pages.

Foraging patterns in online searches

NASA Astrophysics Data System (ADS)

Wang, Xiangwen; Pleimling, Michel

2017-03-01

Nowadays online searches are undeniably the most common form of information gathering, as witnessed by billions of clicks generated each day on search engines. In this work we describe online searches as foraging processes that take place on the semi-infinite line. Using a variety of quantities like probability distributions and complementary cumulative distribution functions of step length and waiting time as well as mean square displacements and entropies, we analyze three different click-through logs that contain the detailed information of millions of queries submitted to search engines. Notable differences between the different logs reveal an increased efficiency of the search engines. In the language of foraging, the newer logs indicate that online searches overwhelmingly yield local searches (i.e., on one page of links provided by the search engines), whereas for the older logs the foraging processes are a combination of local searches and relocation phases that are power law distributed. Our investigation of click logs of search engines therefore highlights the presence of intermittent search processes (where phases of local explorations are separated by power law distributed relocation jumps) in online searches. It follows that good search engines enable the users to find the information they are looking for through a local exploration of a single page with search results, whereas for poor search engine users are often forced to do a broader exploration of different pages.

De novo sequencing and analysis of the transcriptome of Panax ginseng in the leaf-expansion period.

PubMed

Liu, Shichao; Wang, Siming; Liu, Meichen; Yang, Fei; Zhang, Hui; Liu, Shiyang; Wang, Qun; Zhao, Yu

2016-08-01

Panax ginseng, a traditional Chinese medicine, is used worldwide for its variety of health benefits and its treatment efficacy. However, it is difficult to cultivate due to its vulnerability to environmental stresses. The present study provided the first report, to the best of our knowledge, of transcriptome analysis of ginseng at the leaf‑expansion stage. Using the Illumina sequencing platform, >40,000,000 high‑quality paired‑end reads were obtained and assembled into 100,533 unique sequences. When the sequences were searched against the publicly available National Center for Biotechnology Information protein database using The Basic Local Alignment Search Tool, 61,599 sequences exhibited similarity to known proteins. Functional annotation and classification, including use of the Gene Ontology, Clusters of Orthologous Groups, and Kyoto Encyclopedia of Genes and Genomes databases, revealed that the activated genes in ginseng were predominantly ribonuclease‑like storage genes, environmental stress genes, pathogenesis-related genes and other antioxidant genes. A number of candidate genes in environmental stress‑associated pathways were also identified. These novel data provide useful information on the growth and development stages of ginseng, and serve as an important public information platform for further understanding of the molecular mechanisms and functional genomics of ginseng.

A new monozoic tapeworm, Parabreviscolex niepini n. g., n. sp. (Cestoda: Caryophyllidea), from schizothoracine fishes (Cyprinidae: Schizothoracinae) in Tibet, China.

PubMed

Xi, Bing-Wen; Oros, Mikuláš; Chen, Kai; Xie, Jun

2018-02-01

A new monozoic cestode, Parabreviscolex niepini n. gen. and n. sp. (Cestoda: Caryophyllidea), is described from the type-host Schizopygopsis younghusbandi Regan, 1905 (Cyprinidae: Schizothoracinae) and Schizothorax waltoni Regan, 1905 (Cyprinidae: Schizothoracinae) in the Yarlung Tsangpo River, the upper tributary of the Brahmaputra River on the Tibetan Plateau. The new genus is placed in the Capingentidae because the vitellarium is situated partly in the medullary and cortical parenchyma, i.e., neither completely external nor internal to inner longitudinal muscles. Parabreviscolex n. gen. is characterized by possessing an afossate and cuneiform scolex; numerous vitelline follicles and testes present immediately after the scolex, and spread backward near the cirrus sac; the uterus does not loop anterior to the cirrus sac; genital pores separate, opening to the common genital atrium; the pre-ovarian vitelline follicles lateral and median, post-ovarian vitelline follicles present; ovary H-shaped, compact, and ovarian arms long, anteriorly reaching the cirrus sac. Homology search by the basic local alignment search tool (BLAST) showed that the partial 18S rDNA and complete mtDNA cox-1 sequences obtained in this report were not consistent with any sequences available in GenBank, and molecular phylogenetic analyses revealed Parabreviscolex formed a separated long branch within the caryophyllideans from cyprinids.

Saprophytic and Potentially Pathogenic Fusarium Species from Peat Soil in Perak and Pahang

PubMed Central

Karim, Nurul Farah Abdul; Mohd, Masratulhawa; Nor, Nik Mohd Izham Mohd; Zakaria, Latiffah

2016-01-01

Isolates of Fusarium were discovered in peat soil samples collected from peat swamp forest, waterlogged peat soil, and peat soil from oil palm plantations. Morphological characteristics were used to tentatively identify the isolates, and species confirmation was based on the sequence of translation elongation factor-1α (TEF-1α) and phylogenetic analysis. Based on the closest match of Basic Local Alignment Search Tool (BLAST) searches against the GenBank and Fusarium-ID databases, five Fusarium species were identified, namely F. oxysporum (60%), F. solani (23%), F. proliferatum (14%), F. semitectum (1%), and F. verticillioides (1%). From a neighbour-joining tree of combined TEF-1α and β-tubulin sequences, isolates from the same species were clustered in the same clade, though intraspecies variations were observed from the phylogenetic analysis. The Fusarium species isolated in the present study are soil inhabitants and are widely distributed worldwide. These species can act as saprophytes and decomposers as well as plant pathogens. The presence of Fusarium species in peat soils suggested that peat soils could be a reservoir of plant pathogens, as well-known plant pathogenic species such F. oxysporum, F. solani, F. proliferatum, and F. verticillioides were identified. The results of the present study provide knowledge on the survival and distribution of Fusarium species. PMID:27019679

Bacterial analysis of combined periodontal-endodontic lesions by polymerase chain reaction-denaturing gradient gel electrophoresis.

PubMed

Xia, Minghui; Qi, Qingguo

2013-01-01

We used denaturing gradient gel electrophoresis (DGGE) to compare bacterial profiles in periodontium and root canals of teeth with combined periodontal-endodontic lesions. Samples of dental plaque and necrotic pulp were collected from thirteen extracted teeth with advanced periodontitis. Genomic DNA was extracted for polymerase chain reaction (PCR) analysis using universal bacterial primers. The PCR products were then loaded onto DGGE gels to obtain fractionated bands. Characteristic DGGE bands were excised and DNA was cloned and sequenced. The number of bands, which indicates the number of bacterial species, was compared between dental plaques and necrotic pulp tissues from the same tooth. Although the difference was statistically significant (P < 0.01), there was no positive correlation; similarity (Dice coefficient) was 13.1% to 62.5%. Some bacteria species were present in both the periodontal pockets and root canals of the same tooth; however, periodontal bacteria did not always invade the root canals, and some bacteria in root canals were not present in periodontal pockets of the same tooth. In some teeth, unique bacteria in root canals had not passed from periodontal pockets. A basic local alignment search tool (BLAST) sequence search in Genbank indicated that new bacteria species were present in periodontal pockets and root canals. Their characteristics must thus be further analyzed.

Identification of food-grade subtilisins as gluten-degrading enzymes to treat celiac disease

PubMed Central

Wei, Guoxian; Tian, Na; Siezen, Roland; Schuppan, Detlef

2016-01-01

Gluten are proline- and glutamine-rich proteins present in wheat, barley, and rye and contain the immunogenic sequences that drive celiac disease (CD). Rothia mucilaginosa, an oral microbial colonizer, can cleave these gluten epitopes. The aim was to isolate and identify the enzymes and evaluate their potential as novel enzyme therapeutics for CD. The membrane-associated R. mucilaginosa proteins were extracted and separated by DEAE chromatography. Enzyme activities were monitored with paranitroanilide-derivatized and fluorescence resonance energy transfer (FRET) peptide substrates, and by gliadin zymography. Epitope elimination was determined in R5 and G12 ELISAs. The gliadin-degrading Rothia enzymes were identified by LC-ESI-MS/MS as hypothetical proteins ROTMU0001_0241 (C6R5V9_9MICC), ROTMU0001_0243 (C6R5W1_9MICC), and ROTMU0001_240 (C6R5V8_9MICC). A search with the Basic Local Alignment Search Tool revealed that these are subtilisin-like serine proteases belonging to the peptidase S8 family. Alignment of the major Rothia subtilisins indicated that all contain the catalytic triad with Asp (D), His (H), and Ser (S) in the D-H-S order. They cleaved succinyl-Ala-Ala-Pro-Phe-paranitroanilide, a substrate for subtilisin with Pro in the P2 position, as in Tyr-Pro-Gln and Leu-Pro-Tyr in gluten, which are also cleaved. Consistently, FRET substrates of gliadin immunogenic epitopes comprising Xaa-Pro-Xaa motives were rapidly hydrolyzed. The Rothia subtilisins and two subtilisins from Bacillus licheniformis, subtilisin A and the food-grade Nattokinase, efficiently degraded the immunogenic gliadin-derived 33-mer peptide and the immunodominant epitopes recognized by the R5 and G12 antibodies. This study identified Rothia and food-grade Bacillus subtilisins as promising new candidates for enzyme therapeutics in CD. PMID:27469368

Alignment of high-throughput sequencing data inside in-memory databases.

PubMed

Firnkorn, Daniel; Knaup-Gregori, Petra; Lorenzo Bermejo, Justo; Ganzinger, Matthias

2014-01-01

In times of high-throughput DNA sequencing techniques, performance-capable analysis of DNA sequences is of high importance. Computer supported DNA analysis is still an intensive time-consuming task. In this paper we explore the potential of a new In-Memory database technology by using SAP's High Performance Analytic Appliance (HANA). We focus on read alignment as one of the first steps in DNA sequence analysis. In particular, we examined the widely used Burrows-Wheeler Aligner (BWA) and implemented stored procedures in both, HANA and the free database system MySQL, to compare execution time and memory management. To ensure that the results are comparable, MySQL has been running in memory as well, utilizing its integrated memory engine for database table creation. We implemented stored procedures, containing exact and inexact searching of DNA reads within the reference genome GRCh37. Due to technical restrictions in SAP HANA concerning recursion, the inexact matching problem could not be implemented on this platform. Hence, performance analysis between HANA and MySQL was made by comparing the execution time of the exact search procedures. Here, HANA was approximately 27 times faster than MySQL which means, that there is a high potential within the new In-Memory concepts, leading to further developments of DNA analysis procedures in the future.

fRMSDPred: Predicting Local RMSD Between Structural Fragments Using Sequence Information

DTIC Science & Technology

2007-04-04

machine learning approaches for estimating the RMSD value of a pair of protein fragments. These estimated fragment-level RMSD values can be used to construct the alignment, assess the quality of an alignment, and identify high-quality alignment segments. We present algorithms to solve this fragment-level RMSD prediction problem using a supervised learning framework based on support vector regression and classification that incorporates protein profiles, predicted secondary structure, effective information encoding schemes, and novel second-order pairwise exponential kernel

On the Local Convergence of Pattern Search

NASA Technical Reports Server (NTRS)

Dolan, Elizabeth D.; Lewis, Robert Michael; Torczon, Virginia; Bushnell, Dennis M. (Technical Monitor)

2000-01-01

We examine the local convergence properties of pattern search methods, complementing the previously established global convergence properties for this class of algorithms. We show that the step-length control parameter which appears in the definition of pattern search algorithms provides a reliable asymptotic measure of first-order stationarity. This gives an analytical justification for a traditional stopping criterion for pattern search methods. Using this measure of first-order stationarity, we analyze the behavior of pattern search in the neighborhood of an isolated local minimizer. We show that a recognizable subsequence converges r-linearly to the minimizer.

Multi-Objective Community Detection Based on Memetic Algorithm

PubMed Central

2015-01-01

Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels. PMID:25932646

Multi-objective community detection based on memetic algorithm.

PubMed

Wu, Peng; Pan, Li

2015-01-01

Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels.

Planes of satellite galaxies and the cosmic web

NASA Astrophysics Data System (ADS)

Libeskind, Noam I.; Hoffman, Yehuda; Tully, R. Brent; Courtois, Helene M.; Pomarède, Daniel; Gottlöber, Stefan; Steinmetz, Matthias

2015-09-01

Recent observational studies have demonstrated that the majority of satellite galaxies tend to orbit their hosts on highly flattened, vast, possibly corotating planes. Two nearly parallel planes of satellites have been confirmed around the M31 galaxy and around the Centaurus A galaxy, while the Milky Way also sports a plane of satellites. It has been argued that such an alignment of satellites on vast planes is unexpected in the standard Λ cold dark matter (ΛCDM) model of cosmology if not even in contradiction to its generic predictions. Guided by ΛCDM numerical simulations, which suggest that satellites are channelled towards hosts along the axis of the slowest collapse as dictated by the ambient velocity shear tensor, we re-examine the planes of local satellites systems within the framework of the local shear tensor derived from the Cosmicflows-2 data set. The analysis reveals that the Local Group and Centaurus A reside in a filament stretched by the Virgo cluster and compressed by the expansion of the Local Void. Four out of five thin planes of satellite galaxies are indeed closely aligned with the axis of compression induced by the Local Void. Being the less massive system, the moderate misalignment of the Milky Way's satellite plane can likely be ascribed to its greater susceptibility to tidal torques, as suggested by numerical simulations. The alignment of satellite systems in the local Universe with the ambient shear field is thus in general agreement with predictions of the ΛCDM model.

GWFASTA: server for FASTA search in eukaryotic and microbial genomes.

PubMed

Issac, Biju; Raghava, G P S

2002-09-01

Similarity searches are a powerful method for solving important biological problems such as database scanning, evolutionary studies, gene prediction, and protein structure prediction. FASTA is a widely used sequence comparison tool for rapid database scanning. Here we describe the GWFASTA server that was developed to assist the FASTA user in similarity searches against partially and/or completely sequenced genomes. GWFASTA consists of more than 60 microbial genomes, eight eukaryote genomes, and proteomes of annotatedgenomes. Infact, it provides the maximum number of databases for similarity searching from a single platform. GWFASTA allows the submission of more than one sequence as a single query for a FASTA search. It also provides integrated post-processing of FASTA output, including compositional analysis of proteins, multiple sequences alignment, and phylogenetic analysis. Furthermore, it summarizes the search results organism-wise for prokaryotes and chromosome-wise for eukaryotes. Thus, the integration of different tools for sequence analyses makes GWFASTA a powerful toolfor biologists.

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

NASA Technical Reports Server (NTRS)

Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan

2010-01-01

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

DNA Commission of the International Society for Forensic Genetics: revised and extended guidelines for mitochondrial DNA typing.

PubMed

Parson, W; Gusmão, L; Hares, D R; Irwin, J A; Mayr, W R; Morling, N; Pokorak, E; Prinz, M; Salas, A; Schneider, P M; Parsons, T J

2014-11-01

The DNA Commission of the International Society of Forensic Genetics (ISFG) regularly publishes guidelines and recommendations concerning the application of DNA polymorphisms to the question of human identification. Previous recommendations published in 2000 addressed the analysis and interpretation of mitochondrial DNA (mtDNA) in forensic casework. While the foundations set forth in the earlier recommendations still apply, new approaches to the quality control, alignment and nomenclature of mitochondrial sequences, as well as the establishment of mtDNA reference population databases, have been developed. Here, we describe these developments and discuss their application to both mtDNA casework and mtDNA reference population databasing applications. While the generation of mtDNA for forensic casework has always been guided by specific standards, it is now well-established that data of the same quality are required for the mtDNA reference population data used to assess the statistical weight of the evidence. As a result, we introduce guidelines regarding sequence generation, as well as quality control measures based on the known worldwide mtDNA phylogeny, that can be applied to ensure the highest quality population data possible. For both casework and reference population databasing applications, the alignment and nomenclature of haplotypes is revised here and the phylogenetic alignment proffered as acceptable standard. In addition, the interpretation of heteroplasmy in the forensic context is updated, and the utility of alignment-free database searches for unbiased probability estimates is highlighted. Finally, we discuss statistical issues and define minimal standards for mtDNA database searches. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics.

PubMed

Will, Sebastian; Otto, Christina; Miladi, Milad; Möhl, Mathias; Backofen, Rolf

2015-08-01

RNA-Seq experiments have revealed a multitude of novel ncRNAs. The gold standard for their analysis based on simultaneous alignment and folding suffers from extreme time complexity of [Formula: see text]. Subsequently, numerous faster 'Sankoff-style' approaches have been suggested. Commonly, the performance of such methods relies on sequence-based heuristics that restrict the search space to optimal or near-optimal sequence alignments; however, the accuracy of sequence-based methods breaks down for RNAs with sequence identities below 60%. Alignment approaches like LocARNA that do not require sequence-based heuristics, have been limited to high complexity ([Formula: see text] quartic time). Breaking this barrier, we introduce the novel Sankoff-style algorithm 'sparsified prediction and alignment of RNAs based on their structure ensembles (SPARSE)', which runs in quadratic time without sequence-based heuristics. To achieve this low complexity, on par with sequence alignment algorithms, SPARSE features strong sparsification based on structural properties of the RNA ensembles. Following PMcomp, SPARSE gains further speed-up from lightweight energy computation. Although all existing lightweight Sankoff-style methods restrict Sankoff's original model by disallowing loop deletions and insertions, SPARSE transfers the Sankoff algorithm to the lightweight energy model completely for the first time. Compared with LocARNA, SPARSE achieves similar alignment and better folding quality in significantly less time (speedup: 3.7). At similar run-time, it aligns low sequence identity instances substantially more accurate than RAF, which uses sequence-based heuristics. © The Author 2015. Published by Oxford University Press.

SINA: accurate high-throughput multiple sequence alignment of ribosomal RNA genes.

PubMed

Pruesse, Elmar; Peplies, Jörg; Glöckner, Frank Oliver

2012-07-15

In the analysis of homologous sequences, computation of multiple sequence alignments (MSAs) has become a bottleneck. This is especially troublesome for marker genes like the ribosomal RNA (rRNA) where already millions of sequences are publicly available and individual studies can easily produce hundreds of thousands of new sequences. Methods have been developed to cope with such numbers, but further improvements are needed to meet accuracy requirements. In this study, we present the SILVA Incremental Aligner (SINA) used to align the rRNA gene databases provided by the SILVA ribosomal RNA project. SINA uses a combination of k-mer searching and partial order alignment (POA) to maintain very high alignment accuracy while satisfying high throughput performance demands. SINA was evaluated in comparison with the commonly used high throughput MSA programs PyNAST and mothur. The three BRAliBase III benchmark MSAs could be reproduced with 99.3, 97.6 and 96.1 accuracy. A larger benchmark MSA comprising 38 772 sequences could be reproduced with 98.9 and 99.3% accuracy using reference MSAs comprising 1000 and 5000 sequences. SINA was able to achieve higher accuracy than PyNAST and mothur in all performed benchmarks. Alignment of up to 500 sequences using the latest SILVA SSU/LSU Ref datasets as reference MSA is offered at http://www.arb-silva.de/aligner. This page also links to Linux binaries, user manual and tutorial. SINA is made available under a personal use license.

42: DESIGNING A DASHBOARD FOR EVALUATION THE BUSINESS-IT ALIGNMENT STRATEGIES IN HOSPITALS ORGANIZATIONS

PubMed Central

piri, Zakieh; Raef, Behnaz; moftian, Nazila; dehghani, Mohamad; khara, Rouhallah

2017-01-01

Background and aims Business-IT Alignment Evaluation is One of the most important issues that managers should monitor and make decisions about it. Dashboard software combines data and graphical indicators to deliver at-a-glance summaries of information for users to view the state of their business and quickly respond. The aim of this study was to design a dashboard to assess the business-IT alignment strategies for hospitals organizations in Tehran University of Medical Sciences. Methods This is a functional-developmental study. Initially, we searched related databases (PubMed and ProQuest) to determine the key performance indicators of business-IT alignment for selecting the best model for dashboard designing. After selecting the Luftman model, the key indicators were extracted for designing the dashboard model. In the next stage, an electronic questionnaire was designed based on extracted indicators. This questionnaire sends to Hospital managers and IT administrators. Collected data were analyzed by Excel 2015 and displayed in dashboard page. Results The number of key performance indicators was 39. After recognition the technical requirements the dashboard was designed in Excel. The overall business-IT alignment rate in hospitals was 3.12. Amir-aalam hospital has the highest business-IT alignment rate (3.55) and vali-asr hospital has the lowest business-IT alignment rat (2.80). Conclusion Using dashboard software improves the alignment and reduces the time and energy compared with doing this process manually.

Adaptive rood pattern search for fast block-matching motion estimation.

PubMed

Nie, Yao; Ma, Kai-Kuang

2002-01-01

In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) initial search and 2) refined local search. For each macroblock (MB), the initial search is performed only once at the beginning in order to find a good starting point for the follow-up refined local search. By doing so, unnecessary intermediate search and the risk of being trapped into local minimum matching error points could be greatly reduced in long search case. For the initial search stage, an adaptive rood pattern (ARP) is proposed, and the ARP's size is dynamically determined for each MB, based on the available motion vectors (MVs) of the neighboring MBs. In the refined local search stage, a unit-size rood pattern (URP) is exploited repeatedly, and unrestrictedly, until the final MV is found. To further speed up the search, zero-motion prejudgment (ZMP) is incorporated in our method, which is particularly beneficial to those video sequences containing small motion contents. Extensive experiments conducted based on the MPEG-4 Verification Model (VM) encoding platform show that the search speed of our proposed ARPS-ZMP is about two to three times faster than that of the diamond search (DS), and our method even achieves higher peak signal-to-noise ratio (PSNR) particularly for those video sequences containing large and/or complex motion contents.

A correlative microscopy approach relates microtubule behaviour, local organ geometry, and cell growth at the Arabidopsis shoot apical meristem

PubMed Central

Burian, Agata; Uyttewaal, Magalie

2013-01-01

Cortical microtubules (CMTs) are often aligned in a particular direction in individual cells or even in groups of cells and play a central role in the definition of growth anisotropy. How the CMTs themselves are aligned is not well known, but two hypotheses have been proposed. According to the first hypothesis, CMTs align perpendicular to the maximal growth direction, and, according to the second, CMTs align parallel to the maximal stress direction. Since both hypotheses were formulated on the basis of mainly qualitative assessments, the link between CMT organization, organ geometry, and cell growth is revisited using a quantitative approach. For this purpose, CMT orientation, local curvature, and growth parameters for each cell were measured in the growing shoot apical meristem (SAM) of Arabidopsis thaliana. Using this approach, it has been shown that stable CMTs tend to be perpendicular to the direction of maximal growth in cells at the SAM periphery, but parallel in the cells at the boundary domain. When examining the local curvature of the SAM surface, no strict correlation between curvature and CMT arrangement was found, which implies that SAM geometry, and presumed geometry-derived stress distribution, is not sufficient to prescribe the CMT orientation. However, a better match between stress and CMTs was found when mechanical stress derived from differential growth was also considered. PMID:24153420

A correlative microscopy approach relates microtubule behaviour, local organ geometry, and cell growth at the Arabidopsis shoot apical meristem.

PubMed

Burian, Agata; Ludynia, Michal; Uyttewaal, Magalie; Traas, Jan; Boudaoud, Arezki; Hamant, Olivier; Kwiatkowska, Dorota

2013-12-01

Cortical microtubules (CMTs) are often aligned in a particular direction in individual cells or even in groups of cells and play a central role in the definition of growth anisotropy. How the CMTs themselves are aligned is not well known, but two hypotheses have been proposed. According to the first hypothesis, CMTs align perpendicular to the maximal growth direction, and, according to the second, CMTs align parallel to the maximal stress direction. Since both hypotheses were formulated on the basis of mainly qualitative assessments, the link between CMT organization, organ geometry, and cell growth is revisited using a quantitative approach. For this purpose, CMT orientation, local curvature, and growth parameters for each cell were measured in the growing shoot apical meristem (SAM) of Arabidopsis thaliana. Using this approach, it has been shown that stable CMTs tend to be perpendicular to the direction of maximal growth in cells at the SAM periphery, but parallel in the cells at the boundary domain. When examining the local curvature of the SAM surface, no strict correlation between curvature and CMT arrangement was found, which implies that SAM geometry, and presumed geometry-derived stress distribution, is not sufficient to prescribe the CMT orientation. However, a better match between stress and CMTs was found when mechanical stress derived from differential growth was also considered.

Prediction of subcellular localization of eukaryotic proteins using position-specific profiles and neural network with weighted inputs.

PubMed

Zou, Lingyun; Wang, Zhengzhi; Huang, Jiaomin

2007-12-01

Subcellular location is one of the key biological characteristics of proteins. Position-specific profiles (PSP) have been introduced as important characteristics of proteins in this article. In this study, to obtain position-specific profiles, the Position Specific Iterative-Basic Local Alignment Search Tool (PSI-BLAST) has been used to search for protein sequences in a database. Position-specific scoring matrices are extracted from the profiles as one class of characteristics. Four-part amino acid compositions and 1st-7th order dipeptide compositions have also been calculated as the other two classes of characteristics. Therefore, twelve characteristic vectors are extracted from each of the protein sequences. Next, the characteristic vectors are weighed by a simple weighing function and inputted into a BP neural network predictor named PSP-Weighted Neural Network (PSP-WNN). The Levenberg-Marquardt algorithm is employed to adjust the weight matrices and thresholds during the network training instead of the error back propagation algorithm. With a jackknife test on the RH2427 dataset, PSP-WNN has achieved a higher overall prediction accuracy of 88.4% rather than the prediction results by the general BP neural network, Markov model, and fuzzy k-nearest neighbors algorithm on this dataset. In addition, the prediction performance of PSP-WNN has been evaluated with a five-fold cross validation test on the PK7579 dataset and the prediction results have been consistently better than those of the previous method on the basis of several support vector machines, using compositions of both amino acids and amino acid pairs. These results indicate that PSP-WNN is a powerful tool for subcellular localization prediction. At the end of the article, influences on prediction accuracy using different weighting proportions among three characteristic vector categories have been discussed. An appropriate proportion is considered by increasing the prediction accuracy.

An effective PSO-based memetic algorithm for flow shop scheduling.

PubMed

Liu, Bo; Wang, Ling; Jin, Yi-Hui

2007-02-01

This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness of the PSOMA. Additionally, the effects of some parameters on optimization performances are also discussed.

Robust prediction of consensus secondary structures using averaged base pairing probability matrices.

PubMed

Kiryu, Hisanori; Kin, Taishin; Asai, Kiyoshi

2007-02-15

Recent transcriptomic studies have revealed the existence of a considerable number of non-protein-coding RNA transcripts in higher eukaryotic cells. To investigate the functional roles of these transcripts, it is of great interest to find conserved secondary structures from multiple alignments on a genomic scale. Since multiple alignments are often created using alignment programs that neglect the special conservation patterns of RNA secondary structures for computational efficiency, alignment failures can cause potential risks of overlooking conserved stem structures. We investigated the dependence of the accuracy of secondary structure prediction on the quality of alignments. We compared three algorithms that maximize the expected accuracy of secondary structures as well as other frequently used algorithms. We found that one of our algorithms, called McCaskill-MEA, was more robust against alignment failures than others. The McCaskill-MEA method first computes the base pairing probability matrices for all the sequences in the alignment and then obtains the base pairing probability matrix of the alignment by averaging over these matrices. The consensus secondary structure is predicted from this matrix such that the expected accuracy of the prediction is maximized. We show that the McCaskill-MEA method performs better than other methods, particularly when the alignment quality is low and when the alignment consists of many sequences. Our model has a parameter that controls the sensitivity and specificity of predictions. We discussed the uses of that parameter for multi-step screening procedures to search for conserved secondary structures and for assigning confidence values to the predicted base pairs. The C++ source code that implements the McCaskill-MEA algorithm and the test dataset used in this paper are available at http://www.ncrna.org/papers/McCaskillMEA/. Supplementary data are available at Bioinformatics online.

An efficient multi-resolution GA approach to dental image alignment

NASA Astrophysics Data System (ADS)

Nassar, Diaa Eldin; Ogirala, Mythili; Adjeroh, Donald; Ammar, Hany

2006-02-01

Automating the process of postmortem identification of individuals using dental records is receiving an increased attention in forensic science, especially with the large volume of victims encountered in mass disasters. Dental radiograph alignment is a key step required for automating the dental identification process. In this paper, we address the problem of dental radiograph alignment using a Multi-Resolution Genetic Algorithm (MR-GA) approach. We use location and orientation information of edge points as features; we assume that affine transformations suffice to restore geometric discrepancies between two images of a tooth, we efficiently search the 6D space of affine parameters using GA progressively across multi-resolution image versions, and we use a Hausdorff distance measure to compute the similarity between a reference tooth and a query tooth subject to a possible alignment transform. Testing results based on 52 teeth-pair images suggest that our algorithm converges to reasonable solutions in more than 85% of the test cases, with most of the error in the remaining cases due to excessive misalignments.

Perspective: The missing link in academic career planning and development: pursuit of meaningful and aligned work.

PubMed

Lieff, Susan J

2009-10-01

Retention of faculty in academic medicine is a growing challenge. It has been suggested that inattention to the humanistic values of the faculty is contributing to this problem. Professional development should consider faculty members' search for meaning, purpose, and professional fulfillment and should support the development of an ability to reflect on these issues. Ensuring the alignment of academic physicians' inner direction with their outer context is critical to professional fulfillment and effectiveness. Personal reflection on the synergy of one's strengths, passions, and values can help faculty members define meaningful work so as to enable clearer career decision making. The premise of this article is that an awareness of and the pursuit of meaningful work and its alignment with the academic context are important considerations in the professional fulfillment and retention of academic faculty. A conceptual framework for understanding meaningful work and alignment and ways in which that framework can be applied and taught in development programs are presented and discussed.

PSI/TM-Coffee: a web server for fast and accurate multiple sequence alignments of regular and transmembrane proteins using homology extension on reduced databases.

PubMed

Floden, Evan W; Tommaso, Paolo D; Chatzou, Maria; Magis, Cedrik; Notredame, Cedric; Chang, Jia-Ming

2016-07-08

The PSI/TM-Coffee web server performs multiple sequence alignment (MSA) of proteins by combining homology extension with a consistency based alignment approach. Homology extension is performed with Position Specific Iterative (PSI) BLAST searches against a choice of redundant and non-redundant databases. The main novelty of this server is to allow databases of reduced complexity to rapidly perform homology extension. This server also gives the possibility to use transmembrane proteins (TMPs) reference databases to allow even faster homology extension on this important category of proteins. Aside from an MSA, the server also outputs topological prediction of TMPs using the HMMTOP algorithm. Previous benchmarking of the method has shown this approach outperforms the most accurate alignment methods such as MSAProbs, Kalign, PROMALS, MAFFT, ProbCons and PRALINE™. The web server is available at http://tcoffee.crg.cat/tmcoffee. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

Locality in Search Engine Queries and Its Implications for Caching

DTIC Science & Technology

2001-05-01

in the question of whether caching might be effective for search engines as well. They study two real search engine traces by examining query...locality and its implications for caching. The two search engines studied are Vivisimo and Excite. Their trace analysis results show that queries have

Global Regularity for the Fractional Euler Alignment System

NASA Astrophysics Data System (ADS)

Do, Tam; Kiselev, Alexander; Ryzhik, Lenya; Tan, Changhui

2018-04-01

We study a pressureless Euler system with a non-linear density-dependent alignment term, originating in the Cucker-Smale swarming models. The alignment term is dissipative in the sense that it tends to equilibrate the velocities. Its density dependence is natural: the alignment rate increases in the areas of high density due to species discomfort. The diffusive term has the order of a fractional Laplacian {(-partial _{xx})^{α/2}, α \\in (0, 1)}. The corresponding Burgers equation with a linear dissipation of this type develops shocks in a finite time. We show that the alignment nonlinearity enhances the dissipation, and the solutions are globally regular for all {α \\in (0, 1)}. To the best of our knowledge, this is the first example of such regularization due to the non-local nonlinear modulation of dissipation.

Identifying Natural Alignments Between Ambulatory Surgery Centers and Local Health Systems: Building Broader Communities of Surgical Care.

PubMed

Funk, Russell J; Owen-Smith, Jason; Landon, Bruce E; Birkmeyer, John D; Hollingsworth, John M

2017-02-01

To develop and compare methods for identifying natural alignments between ambulatory surgery centers (ASCs) and hospitals that anchor local health systems. Using all-payer data from Florida's State Ambulatory Surgery and Inpatient Databases (2005-2009), we developed 3 methods for identifying alignments between ASCS and hospitals. The first, a geographic proximity approach, used spatial data to assign an ASC to its nearest hospital neighbor. The second, a predominant affiliation approach, assigned an ASC to the hospital with which it shared a plurality of surgeons. The third, a network community approach, linked an ASC with a larger group of hospitals held together by naturally occurring physician networks. We compared each method in terms of its ability to capture meaningful and stable affiliations and its administrative simplicity. Although the proximity approach was simplest to implement and produced the most durable alignments, ASC surgeon's loyalty to the assigned hospital was low with this method. The predominant affiliation and network community approaches performed better and nearly equivalently on these metrics, capturing more meaningful affiliations between ASCs and hospitals. However, the latter's alignments were least durable, and it was complex to administer. We describe 3 methods for identifying natural alignments between ASCs and hospitals, each with strengths and weaknesses. These methods will help health system managers identify ASCs with which to partner. Moreover, health services researchers and policy analysts can use them to study broader communities of surgical care.

Implementing a search for gravitational waves from binary black holes with nonprecessing spin

NASA Astrophysics Data System (ADS)

Capano, Collin; Harry, Ian; Privitera, Stephen; Buonanno, Alessandra

2016-06-01

Searching for gravitational waves (GWs) from binary black holes (BBHs) with LIGO and Virgo involves matched-filtering data against a set of representative signal waveforms—a template bank—chosen to cover the full signal space of interest with as few template waveforms as possible. Although the component black holes may have significant angular momenta (spin), previous searches for BBHs have filtered LIGO and Virgo data using only waveforms where both component spins are zero. This leads to a loss of signal-to-noise ratio for signals where this is not the case. Combining the best available template placement techniques and waveform models, we construct a template bank of GW signals from BBHs with component spins χ1 ,2∈[-0.99 ,0.99 ] aligned with the orbital angular momentum, component masses m1 ,2∈[2 ,48 ]M⊙ , and total mass Mtotal≤50 M⊙ . Using effective-one-body waveforms with spin effects, we show that less than 3% of the maximum signal-to-noise ratio (SNR) of these signals is lost due to the discreetness of the bank, using the early Advanced LIGO noise curve. We use simulated Advanced LIGO noise to compare the sensitivity of this bank to a nonspinning bank covering the same parameter space. In doing so, we consider the competing effects between improved SNR and signal-based vetoes and the increase in the rate of false alarms of the aligned-spin bank due to covering a larger parameter space. We find that the aligned-spin bank can be a factor of 1.3-5 more sensitive than a nonspinning bank to BBHs with dimensionless spins >+0.6 and component masses ≳20 M⊙ . Even larger gains are obtained for systems with equally high spins but smaller component masses.

Dynamic localization of Mps1 kinase to kinetochores is essential for accurate spindle microtubule attachment

PubMed Central

Dou, Zhen; Liu, Xing; Wang, Wenwen; Zhu, Tongge; Wang, Xinghui; Xu, Leilei; Abrieu, Ariane; Fu, Chuanhai; Hill, Donald L.; Yao, Xuebiao

2015-01-01

The spindle assembly checkpoint (SAC) is a conserved signaling pathway that monitors faithful chromosome segregation during mitosis. As a core component of SAC, the evolutionarily conserved kinase monopolar spindle 1 (Mps1) has been implicated in regulating chromosome alignment, but the underlying molecular mechanism remains unclear. Our molecular delineation of Mps1 activity in SAC led to discovery of a previously unidentified structural determinant underlying Mps1 function at the kinetochores. Here, we show that Mps1 contains an internal region for kinetochore localization (IRK) adjacent to the tetratricopeptide repeat domain. Importantly, the IRK region determines the kinetochore localization of inactive Mps1, and an accumulation of inactive Mps1 perturbs accurate chromosome alignment and mitotic progression. Mechanistically, the IRK region binds to the nuclear division cycle 80 complex (Ndc80C), and accumulation of inactive Mps1 at the kinetochores prevents a dynamic interaction between Ndc80C and spindle microtubules (MTs), resulting in an aberrant kinetochore attachment. Thus, our results present a previously undefined mechanism by which Mps1 functions in chromosome alignment by orchestrating Ndc80C–MT interactions and highlight the importance of the precise spatiotemporal regulation of Mps1 kinase activity and kinetochore localization in accurate mitotic progression. PMID:26240331

Dynamic localization of Mps1 kinase to kinetochores is essential for accurate spindle microtubule attachment.

PubMed

Dou, Zhen; Liu, Xing; Wang, Wenwen; Zhu, Tongge; Wang, Xinghui; Xu, Leilei; Abrieu, Ariane; Fu, Chuanhai; Hill, Donald L; Yao, Xuebiao

2015-08-18

The spindle assembly checkpoint (SAC) is a conserved signaling pathway that monitors faithful chromosome segregation during mitosis. As a core component of SAC, the evolutionarily conserved kinase monopolar spindle 1 (Mps1) has been implicated in regulating chromosome alignment, but the underlying molecular mechanism remains unclear. Our molecular delineation of Mps1 activity in SAC led to discovery of a previously unidentified structural determinant underlying Mps1 function at the kinetochores. Here, we show that Mps1 contains an internal region for kinetochore localization (IRK) adjacent to the tetratricopeptide repeat domain. Importantly, the IRK region determines the kinetochore localization of inactive Mps1, and an accumulation of inactive Mps1 perturbs accurate chromosome alignment and mitotic progression. Mechanistically, the IRK region binds to the nuclear division cycle 80 complex (Ndc80C), and accumulation of inactive Mps1 at the kinetochores prevents a dynamic interaction between Ndc80C and spindle microtubules (MTs), resulting in an aberrant kinetochore attachment. Thus, our results present a previously undefined mechanism by which Mps1 functions in chromosome alignment by orchestrating Ndc80C-MT interactions and highlight the importance of the precise spatiotemporal regulation of Mps1 kinase activity and kinetochore localization in accurate mitotic progression.

Hybridization of decomposition and local search for multiobjective optimization.

PubMed

Ke, Liangjun; Zhang, Qingfu; Battiti, Roberto

2014-10-01

Combining ideas from evolutionary algorithms, decomposition approaches, and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: memetic algorithm based on decomposition (MOMAD). It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MOMAD evolves three populations: 1) population P(L) for recording the current solution to each subproblem; 2) population P(P) for storing starting solutions for Pareto local search; and 3) an external population P(E) for maintaining all the nondominated solutions found so far during the search. A problem-specific single objective heuristic can be applied to these subproblems to initialize the three populations. At each generation, a Pareto local search method is first applied to search a neighborhood of each solution in P(P) to update P(L) and P(E). Then a single objective local search is applied to each perturbed solution in P(L) for improving P(L) and P(E), and reinitializing P(P). The procedure is repeated until a stopping condition is met. MOMAD provides a generic hybrid multiobjective algorithmic framework in which problem specific knowledge, well developed single objective local search and heuristics and Pareto local search methods can be hybridized. It is a population based iterative method and thus an anytime algorithm. Extensive experiments have been conducted in this paper to study MOMAD and compare it with some other state-of-the-art algorithms on the multiobjective traveling salesman problem and the multiobjective knapsack problem. The experimental results show that our proposed algorithm outperforms or performs similarly to the best so far heuristics on these two problems.

An Analysis of State and Local Alignment of Teacher Evaluation in Maryland

ERIC Educational Resources Information Center

Peterson, Serene N.

2014-01-01

This study explored the components of Maryland's newly-implemented teacher evaluation framework and compared state requirements with evaluations to three local school systems' evaluation procedures. The study sought to investigate the relationship between three evaluation protocols in comparison to the state requirements. Three local school…

Analytic Guided-Search Model of Human Performance Accuracy in Target- Localization Search Tasks

NASA Technical Reports Server (NTRS)

Eckstein, Miguel P.; Beutter, Brent R.; Stone, Leland S.

2000-01-01

Current models of human visual search have extended the traditional serial/parallel search dichotomy. Two successful models for predicting human visual search are the Guided Search model and the Signal Detection Theory model. Although these models are inherently different, it has been difficult to compare them because the Guided Search model is designed to predict response time, while Signal Detection Theory models are designed to predict performance accuracy. Moreover, current implementations of the Guided Search model require the use of Monte-Carlo simulations, a method that makes fitting the model's performance quantitatively to human data more computationally time consuming. We have extended the Guided Search model to predict human accuracy in target-localization search tasks. We have also developed analytic expressions that simplify simulation of the model to the evaluation of a small set of equations using only three free parameters. This new implementation and extension of the Guided Search model will enable direct quantitative comparisons with human performance in target-localization search experiments and with the predictions of Signal Detection Theory and other search accuracy models.

An efficient grid layout algorithm for biological networks utilizing various biological attributes

PubMed Central

Kojima, Kaname; Nagasaki, Masao; Jeong, Euna; Kato, Mitsuru; Miyano, Satoru

2007-01-01

Background Clearly visualized biopathways provide a great help in understanding biological systems. However, manual drawing of large-scale biopathways is time consuming. We proposed a grid layout algorithm that can handle gene-regulatory networks and signal transduction pathways by considering edge-edge crossing, node-edge crossing, distance measure between nodes, and subcellular localization information from Gene Ontology. Consequently, the layout algorithm succeeded in drastically reducing these crossings in the apoptosis model. However, for larger-scale networks, we encountered three problems: (i) the initial layout is often very far from any local optimum because nodes are initially placed at random, (ii) from a biological viewpoint, human layouts still exceed automatic layouts in understanding because except subcellular localization, it does not fully utilize biological information of pathways, and (iii) it employs a local search strategy in which the neighborhood is obtained by moving one node at each step, and automatic layouts suggest that simultaneous movements of multiple nodes are necessary for better layouts, while such extension may face worsening the time complexity. Results We propose a new grid layout algorithm. To address problem (i), we devised a new force-directed algorithm whose output is suitable as the initial layout. For (ii), we considered that an appropriate alignment of nodes having the same biological attribute is one of the most important factors of the comprehension, and we defined a new score function that gives an advantage to such configurations. For solving problem (iii), we developed a search strategy that considers swapping nodes as well as moving a node, while keeping the order of the time complexity. Though a naïve implementation increases by one order, the time complexity, we solved this difficulty by devising a method that caches differences between scores of a layout and its possible updates. Conclusion Layouts of the new grid layout algorithm are compared with that of the previous algorithm and human layout in an endothelial cell model, three times as large as the apoptosis model. The total cost of the result from the new grid layout algorithm is similar to that of the human layout. In addition, its convergence time is drastically reduced (40% reduction). PMID:17338825

Bayesian comparison of protein structures using partial Procrustes distance.

PubMed

Ejlali, Nasim; Faghihi, Mohammad Reza; Sadeghi, Mehdi

2017-09-26

An important topic in bioinformatics is the protein structure alignment. Some statistical methods have been proposed for this problem, but most of them align two protein structures based on the global geometric information without considering the effect of neighbourhood in the structures. In this paper, we provide a Bayesian model to align protein structures, by considering the effect of both local and global geometric information of protein structures. Local geometric information is incorporated to the model through the partial Procrustes distance of small substructures. These substructures are composed of β-carbon atoms from the side chains. Parameters are estimated using a Markov chain Monte Carlo (MCMC) approach. We evaluate the performance of our model through some simulation studies. Furthermore, we apply our model to a real dataset and assess the accuracy and convergence rate. Results show that our model is much more efficient than previous approaches.

The place of the Local Group in the cosmic web

NASA Astrophysics Data System (ADS)

Forero-Romero, Jaime E.; González, Roberto

2016-10-01

We use the Bolshoi Simulation to find the most probable location of the Local Group (LG) in the cosmic web. Our LG simulacra are pairs of halos with isolation and kinematic properties consistent with observations. The cosmic web is defined using a tidal tensor approach. We find that the LG's preferred location is regions with a dark matter overdensity close to the cosmic average. This makes filaments and sheets the preferred environment. We also find a strong alignment between the LG and the cosmic web. The orbital angular momentum is preferentially perpendicular to the smallest tidal eigenvector, while the vector connecting the two halos is strongly aligned along the the smallest tidal eigenvector and perpendicular to the largest tidal eigenvector; the pair lies and moves along filaments and sheets. We do not find any evidence for an alignment between the spin of each halo in the pair and the cosmic web.

Initial Alignment for SINS Based on Pseudo-Earth Frame in Polar Regions.

PubMed

Gao, Yanbin; Liu, Meng; Li, Guangchun; Guang, Xingxing

2017-06-16

An accurate initial alignment must be required for inertial navigation system (INS). The performance of initial alignment directly affects the following navigation accuracy. However, the rapid convergence of meridians and the small horizontalcomponent of rotation of Earth make the traditional alignment methods ineffective in polar regions. In this paper, from the perspective of global inertial navigation, a novel alignment algorithm based on pseudo-Earth frame and backward process is proposed to implement the initial alignment in polar regions. Considering that an accurate coarse alignment of azimuth is difficult to obtain in polar regions, the dynamic error modeling with large azimuth misalignment angle is designed. At the end of alignment phase, the strapdown attitude matrix relative to local geographic frame is obtained without influence of position errors and cumbersome computation. As a result, it would be more convenient to access the following polar navigation system. Then, it is also expected to unify the polar alignment algorithm as much as possible, thereby further unifying the form of external reference information. Finally, semi-physical static simulation and in-motion tests with large azimuth misalignment angle assisted by unscented Kalman filter (UKF) validate the effectiveness of the proposed method.

A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem

NASA Astrophysics Data System (ADS)

Nguyen, Viet-Phuong; Prins, Christian; Prodhon, Caroline

This paper presents a new hybrid metaheuristic between a greedy randomized adaptive search procedure (GRASP) and an evolutionary/iterated local search (ELS/ILS), using Tabu list to solve the two-echelon location routing problem (LRP-2E). The GRASP uses in turn three constructive heuristics followed by local search to generate the initial solutions. From a solution of GRASP, an intensification strategy is carried out by a dynamic alternation between ELS and ILS. In this phase, each child is obtained by mutation and evaluated through a splitting procedure of giant tour followed by a local search. The tabu list, defined by two characteristics of solution (total cost and number of trips), is used to avoid searching a space already explored. The results show that our metaheuristic clearly outperforms all previously published methods on LRP-2E benchmark instances. Furthermore, it is competitive with the best meta-heuristic published for the single-echelon LRP.

Designing a Bioengine for Detection and Analysis of Base String on an Affected Sequence in High-Concentration Regions

PubMed Central

Mandal, Bijoy Kumar; Kim, Tai-hoon

2013-01-01

We design an Algorithm for bioengine. As a program are enable optimal alignments searching between two sequences, the host sequence (normal plant) as well as query sequence (virus). Searching for homologues has become a routine operation of biological sequences in 4 × 4 combination with different subsequence (word size). This program takes the advantage of the high degree of homology between such sequences to construct an alignment of the matching regions. There is a main aim which is to detect the overlapping reading frames. This program also enables to find out the highly infected colones selection highest matching region with minimum gap or mismatch zones and unique virus colones matches. This is a small, portable, interactive, front-end program intended to be used to find out the regions of matching between host sequence and query subsequences. All the operations are carried out in fraction of seconds, depending on the required task and on the sequence length. PMID:24000321

Word aligned bitmap compression method, data structure, and apparatus

DOEpatents

Wu, Kesheng; Shoshani, Arie; Otoo, Ekow

2004-12-14

The Word-Aligned Hybrid (WAH) bitmap compression method and data structure is a relatively efficient method for searching and performing logical, counting, and pattern location operations upon large datasets. The technique is comprised of a data structure and methods that are optimized for computational efficiency by using the WAH compression method, which typically takes advantage of the target computing system's native word length. WAH is particularly apropos to infrequently varying databases, including those found in the on-line analytical processing (OLAP) industry, due to the increased computational efficiency of the WAH compressed bitmap index. Some commercial database products already include some version of a bitmap index, which could possibly be replaced by the WAH bitmap compression techniques for potentially increased operation speed, as well as increased efficiencies in constructing compressed bitmaps. Combined together, this technique may be particularly useful for real-time business intelligence. Additional WAH applications may include scientific modeling, such as climate and combustion simulations, to minimize search time for analysis and subsequent data visualization.

Chapter 51: How to Build a Simple Cone Search Service Using a Local Database

NASA Astrophysics Data System (ADS)

Kent, B. R.; Greene, G. R.

The cone search service protocol will be examined from the server side in this chapter. A simple cone search service will be setup and configured locally using MySQL. Data will be read into a table, and the Java JDBC will be used to connect to the database. Readers will understand the VO cone search specification and how to use it to query a database on their local systems and return an XML/VOTable file based on an input of RA/DEC coordinates and a search radius. The cone search in this example will be deployed as a Java servlet. The resulting cone search can be tested with a verification service. This basic setup can be used with other languages and relational databases.

On local search for bi-objective knapsack problems.

PubMed

Liefooghe, Arnaud; Paquete, Luís; Figueira, José Rui

2013-01-01

In this article, a local search approach is proposed for three variants of the bi-objective binary knapsack problem, with the aim of maximizing the total profit and minimizing the total weight. First, an experimental study on a given structural property of connectedness of the efficient set is conducted. Based on this property, a local search algorithm is proposed and its performance is compared to exact algorithms in terms of runtime and quality metrics. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact algorithms.

Memetic Approaches for Optimizing Hidden Markov Models: A Case Study in Time Series Prediction

NASA Astrophysics Data System (ADS)

Bui, Lam Thu; Barlow, Michael

We propose a methodology for employing memetics (local search) within the framework of evolutionary algorithms to optimize parameters of hidden markov models. With this proposal, the rate and frequency of using local search are automatically changed over time either at a population or individual level. At the population level, we allow the rate of using local search to decay over time to zero (at the final generation). At the individual level, each individual is equipped with information of when it will do local search and for how long. This information evolves over time alongside the main elements of the chromosome representing the individual.

Robust local search for spacecraft operations using adaptive noise

NASA Technical Reports Server (NTRS)

Fukunaga, Alex S.; Rabideau, Gregg; Chien, Steve

2004-01-01

Randomization is a standard technique for improving the performance of local search algorithms for constraint satisfaction. However, it is well-known that local search algorithms are constraints satisfaction. However, it is well-known that local search algorithms are to the noise values selected. We investigate the use of an adaptive noise mechanism in an iterative repair-based planner/scheduler for spacecraft operations. Preliminary results indicate that adaptive noise makes the use of randomized repair moves safe and robust; that is, using adaptive noise makes it possible to consistently achieve, performance comparable with the best tuned noise setting without the need for manually tuning the noise parameter.

Interfraction Displacement of Primary Tumor and Involved Lymph Nodes Relative to Anatomic Landmarks in Image Guided Radiation Therapy of Locally Advanced Lung Cancer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jan, Nuzhat; Balik, Salim; Hugo, Geoffrey D.

Purpose: To analyze primary tumor (PT) and lymph node (LN) position changes relative to each other and relative to anatomic landmarks during conventionally fractionated radiation therapy for patients with locally advanced lung cancer. Methods and Materials: In 12 patients with locally advanced non-small cell lung cancer PT, LN, carina, and 1 thoracic vertebra were manually contoured on weekly 4-dimensional fan-beam CT scans. Systematic and random interfraction displacements of all contoured structures were identified in the 3 cardinal directions, and resulting setup margins were calculated. Time trends and the effect of volume changes on displacements were analyzed. Results: Three-dimensional displacement vectorsmore » and systematic/random interfraction displacements were smaller for carina than for vertebra both for PT and LN. For PT, mean (SD) 3-dimensional displacement vectors with carina-based alignment were 7 (4) mm versus 9 (5) mm with bony anatomy (P<.0001). For LN, smaller displacements were found with carina- (5 [3] mm, P<.0001) and vertebra-based (6 [3] mm, P=.002) alignment compared with using PT for setup (8 [5] mm). Primary tumor and LN displacements relative to bone and carina were independent (P>.05). Displacements between PT and bone (P=.04) and between PT and LN (P=.01) were significantly correlated with PT volume regression. Displacements between LN and carina were correlated with LN volume change (P=.03). Conclusions: Carina-based setup results in a more reproducible PT and LN alignment than bony anatomy setup. Considering the independence of PT and LN displacement and the impact of volume regression on displacements over time, repeated CT imaging even with PT-based alignment is recommended in locally advanced disease.« less

CAB-Align: A Flexible Protein Structure Alignment Method Based on the Residue-Residue Contact Area.

PubMed

Terashi, Genki; Takeda-Shitaka, Mayuko

2015-01-01

Proteins are flexible, and this flexibility has an essential functional role. Flexibility can be observed in loop regions, rearrangements between secondary structure elements, and conformational changes between entire domains. However, most protein structure alignment methods treat protein structures as rigid bodies. Thus, these methods fail to identify the equivalences of residue pairs in regions with flexibility. In this study, we considered that the evolutionary relationship between proteins corresponds directly to the residue-residue physical contacts rather than the three-dimensional (3D) coordinates of proteins. Thus, we developed a new protein structure alignment method, contact area-based alignment (CAB-align), which uses the residue-residue contact area to identify regions of similarity. The main purpose of CAB-align is to identify homologous relationships at the residue level between related protein structures. The CAB-align procedure comprises two main steps: First, a rigid-body alignment method based on local and global 3D structure superposition is employed to generate a sufficient number of initial alignments. Then, iterative dynamic programming is executed to find the optimal alignment. We evaluated the performance and advantages of CAB-align based on four main points: (1) agreement with the gold standard alignment, (2) alignment quality based on an evolutionary relationship without 3D coordinate superposition, (3) consistency of the multiple alignments, and (4) classification agreement with the gold standard classification. Comparisons of CAB-align with other state-of-the-art protein structure alignment methods (TM-align, FATCAT, and DaliLite) using our benchmark dataset showed that CAB-align performed robustly in obtaining high-quality alignments and generating consistent multiple alignments with high coverage and accuracy rates, and it performed extremely well when discriminating between homologous and nonhomologous pairs of proteins in both single and multi-domain comparisons. The CAB-align software is freely available to academic users as stand-alone software at http://www.pharm.kitasato-u.ac.jp/bmd/bmd/Publications.html.

Physician-Hospital Alignment in Orthopedic Surgery.

PubMed

Bushnell, Brandon D

2015-09-01

The concept of "alignment" between physicians and hospitals is a popular buzzword in the age of health care reform. Despite their often tumultuous histories, physicians and hospitals find themselves under increasing pressures to work together toward common goals. However, effective alignment is more than just simple cooperation between parties. The process of achieving alignment does not have simple, universal steps. Alignment will differ based on individual situational factors and the type of specialty involved. Ultimately, however, there are principles that underlie the concept of alignment and should be a part of any physician-hospital alignment efforts. In orthopedic surgery, alignment involves the clinical, administrative, financial, and even personal aspects of a surgeon's practice. It must be based on the principles of financial interest, clinical authority, administrative participation, transparency, focus on the patient, and mutual necessity. Alignment can take on various forms as well, with popular models consisting of shared governance and comanagement, gainsharing, bundled payments, accountable care organizations, and other methods. As regulatory and financial pressures continue to motivate physicians and hospitals to develop alignment relationships, new and innovative methods of alignment will also appear. Existing models will mature and evolve, with individual variability based on local factors. However, certain trends seem to be appearing as time progresses and alignment relationships deepen, including regional and national collaboration, population management, and changes in the legal system. This article explores the history, principles, and specific methods of physician-hospital alignment and its critical importance for the future of health care delivery. Copyright 2015, SLACK Incorporated.

A mean-field theory for self-propelled particles interacting by velocity alignment mechanisms

NASA Astrophysics Data System (ADS)

Peruani, F.; Deutsch, A.; Bär, M.

2008-04-01

A mean-field approach (MFA) is proposed for the analysis of orientational order in a two-dimensional system of stochastic self-propelled particles interacting by local velocity alignment mechanism. The treatment is applied to the cases of ferromagnetic (F) and liquid-crystal (LC) alignment. In both cases, MFA yields a second order phase transition for a critical noise strength and a scaling exponent of 1/2 for the respective order parameters. We find that the critical noise amplitude ηc at which orientational order emerges in the LC case is smaller than in the F-alignment case, i.e. ηLC C<ηF C. A comparison with simulations of individual-based models with F- resp. LC-alignment shows that the predictions about the critical behavior and the qualitative relation between the respective critical noise amplitudes are correct.

Modeling and prediction of human word search behavior in interactive machine translation

NASA Astrophysics Data System (ADS)

Ji, Duo; Yu, Bai; Ma, Bin; Ye, Na

2017-12-01

As a kind of computer aided translation method, Interactive Machine Translation technology reduced manual translation repetitive and mechanical operation through a variety of methods, so as to get the translation efficiency, and played an important role in the practical application of the translation work. In this paper, we regarded the behavior of users' frequently searching for words in the translation process as the research object, and transformed the behavior to the translation selection problem under the current translation. The paper presented a prediction model, which is a comprehensive utilization of alignment model, translation model and language model of the searching words behavior. It achieved a highly accurate prediction of searching words behavior, and reduced the switching of mouse and keyboard operations in the users' translation process.

HIA: a genome mapper using hybrid index-based sequence alignment.

PubMed

Choi, Jongpill; Park, Kiejung; Cho, Seong Beom; Chung, Myungguen

2015-01-01

A number of alignment tools have been developed to align sequencing reads to the human reference genome. The scale of information from next-generation sequencing (NGS) experiments, however, is increasing rapidly. Recent studies based on NGS technology have routinely produced exome or whole-genome sequences from several hundreds or thousands of samples. To accommodate the increasing need of analyzing very large NGS data sets, it is necessary to develop faster, more sensitive and accurate mapping tools. HIA uses two indices, a hash table index and a suffix array index. The hash table performs direct lookup of a q-gram, and the suffix array performs very fast lookup of variable-length strings by exploiting binary search. We observed that combining hash table and suffix array (hybrid index) is much faster than the suffix array method for finding a substring in the reference sequence. Here, we defined the matching region (MR) is a longest common substring between a reference and a read. And, we also defined the candidate alignment regions (CARs) as a list of MRs that is close to each other. The hybrid index is used to find candidate alignment regions (CARs) between a reference and a read. We found that aligning only the unmatched regions in the CAR is much faster than aligning the whole CAR. In benchmark analysis, HIA outperformed in mapping speed compared with the other aligners, without significant loss of mapping accuracy. Our experiments show that the hybrid of hash table and suffix array is useful in terms of speed for mapping NGS sequencing reads to the human reference genome sequence. In conclusion, our tool is appropriate for aligning massive data sets generated by NGS sequencing.

Hole localization, water dissociation mechanisms, and band alignment at aqueous-titania interfaces

NASA Astrophysics Data System (ADS)

Lyons, John L.

Photocatalytic water splitting is a promising method for generating clean energy, but materials that can efficiently act as photocatalysts are scarce. This is in part due to the fact that exposure to water can strongly alter semiconductor surfaces and therefore photocatalyst performance. Many materials are not stable in aqueous environments; in other cases, local changes in structure may occur, affecting energy-level alignment. Even in the simplest case, dynamic fluctuations modify the organization of interface water. Accounting for such effects requires knowledge of the dominant local structural motifs and also accurate semiconductor band-edge positions, making quantitative prediction of energy-level alignments computationally challenging. Here we employ a combined theoretical approach to study the structure, energy alignment, and hole localization at aqueous-titania interfaces. We calculate the explicit aqueous-semiconductor interface using ab initio molecular dynamics, which provides the fluctuating atomic structure, the extent of water dissociation, and the resulting electrostatic potential. For both anatase and rutile TiO2 we observe spontaneous water dissociation and re-association events that occur via distinct mechanisms. We also find a higher-density water layer occurring on anatase. In both cases, we find that the second monolayer of water plays a crucial role in controlling the extent of water dissociation. Using hybrid functional calculations, we then investigate the propensity for dissociated waters to stabilize photo-excited carriers, and compare the results of rutile and anatase aqueous interfaces. Finally, we use the GW approach from many-body perturbation theory to obtain the position of semiconductor band edges relative to the occupied 1b1 level and thus the redox levels of water, and examine how local structural modifications affect these offsets. This work was performed in collaboration with N. Kharche, M. Z. Ertem, J. T. Muckerman, and M. S. Hybertsen. It made use of resources at the Center for Functional Nanomaterials, which is a U.S. DOE Office of Science Facility, at Brookhaven National Lab.

Melody Alignment and Similarity Metric for Content-Based Music Retrieval

NASA Astrophysics Data System (ADS)

Zhu, Yongwei; Kankanhalli, Mohan S.

2003-01-01

Music query-by-humming has attracted much research interest recently. It is a challenging problem since the hummed query inevitably contains much variation and inaccuracy. Furthermore, the similarity computation between the query tune and the reference melody is not easy due to the difficulty in ensuring proper alignment. This is because the query tune can be rendered at an unknown speed and it is usually an arbitrary subsequence of the target reference melody. Many of the previous methods, which adopt note segmentation and string matching, suffer drastically from the errors in the note segmentation, which affects retrieval accuracy and efficiency. Some methods solve the alignment issue by controlling the speed of the articulation of queries, which is inconvenient because it forces users to hum along a metronome. Some other techniques introduce arbitrary rescaling in time but this is computationally very inefficient. In this paper, we introduce a melody alignment technique, which addresses the robustness and efficiency issues. We also present a new melody similarity metric, which is performed directly on melody contours of the query data. This approach cleanly separates the alignment and similarity measurement in the search process. We show how to robustly and efficiently align the query melody with the reference melodies and how to measure the similarity subsequently. We have carried out extensive experiments. Our melody alignment method can reduce the matching candidate to 1.7% with 95% correct alignment rate. The overall retrieval system achieved 80% recall in the top 10 rank list. The results demonstrate the robustness and effectiveness the proposed methods.

Complementarity between nonstandard Higgs boson searches and precision Higgs boson measurements in the MSSM

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carena, Marcela; Haber, Howard E.; Low, Ian

Precision measurements of the Higgs boson properties at the LHC provide relevant constraints on possible weak-scale extensions of the Standard Model (SM). In the context of the minimal supersymmetric Standard Model (MSSM) these constraints seem to suggest that all the additional, non-SM-like Higgs bosons should be heavy, with masses larger than about 400 GeV. This article shows that such results do not hold when the theory approaches the conditions for “alignment independent of decoupling,” where the lightest CP-even Higgs boson has SM-like tree-level couplings to fermions and gauge bosons, independently of the nonstandard Higgs boson masses. In addition, the combinationmore » of current bounds from direct Higgs boson searches at the LHC, along with the alignment conditions, have a significant impact on the allowed MSSM parameter space yielding light additional Higgs bosons. In particular, after ensuring the correct mass for the lightest CP-even Higgs boson, we find that precision measurements and direct searches are complementary and may soon be able to probe the region of non-SM-like Higgs boson with masses below the top quark pair mass threshold of 350 GeV and low to moderate values of tanβ.« less

Complementarity between nonstandard Higgs boson searches and precision Higgs boson measurements in the MSSM

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carena, Marcela; Haber, Howard E.; Low, Ian

Precision measurements of the Higgs boson properties at the LHC provide relevant constraints on possible weak-scale extensions of the Standard Model (SM). In the context of the minimal supersymmetric Standard Model (MSSM) these constraints seem to suggest that all the additional, non-SM-like Higgs bosons should be heavy, with masses larger than about 400 GeV. This article shows that such results do not hold when the theory approaches the conditions for “alignment independent of decoupling,” where the lightest CP -even Higgs boson has SM-like tree-level couplings to fermions and gauge bosons, independently of the nonstandard Higgs boson masses. The combination ofmore » current bounds from direct Higgs boson searches at the LHC, along with the alignment conditions, have a significant impact on the allowed MSSM parameter space yielding light additional Higgs bosons. In particular, after ensuring the correct mass for the lightest CP -even Higgs boson, we find that precision measurements and direct searches are complementary and may soon be able to probe the region of non-SM-like Higgs boson with masses below the top quark pair mass threshold of 350 GeV and low to moderate values of tanβ« less

Complementarity between nonstandard Higgs boson searches and precision Higgs boson measurements in the MSSM

DOE PAGES

Carena, Marcela; Haber, Howard E.; Low, Ian; ...

2015-02-03

Precision measurements of the Higgs boson properties at the LHC provide relevant constraints on possible weak-scale extensions of the Standard Model (SM). In the context of the minimal supersymmetric Standard Model (MSSM) these constraints seem to suggest that all the additional, non-SM-like Higgs bosons should be heavy, with masses larger than about 400 GeV. This article shows that such results do not hold when the theory approaches the conditions for “alignment independent of decoupling,” where the lightest CP-even Higgs boson has SM-like tree-level couplings to fermions and gauge bosons, independently of the nonstandard Higgs boson masses. In addition, the combinationmore » of current bounds from direct Higgs boson searches at the LHC, along with the alignment conditions, have a significant impact on the allowed MSSM parameter space yielding light additional Higgs bosons. In particular, after ensuring the correct mass for the lightest CP-even Higgs boson, we find that precision measurements and direct searches are complementary and may soon be able to probe the region of non-SM-like Higgs boson with masses below the top quark pair mass threshold of 350 GeV and low to moderate values of tanβ.« less

Precise Synaptic Efficacy Alignment Suggests Potentiation Dominated Learning.

PubMed

Hartmann, Christoph; Miner, Daniel C; Triesch, Jochen

2015-01-01

Recent evidence suggests that parallel synapses from the same axonal branch onto the same dendritic branch have almost identical strength. It has been proposed that this alignment is only possible through learning rules that integrate activity over long time spans. However, learning mechanisms such as spike-timing-dependent plasticity (STDP) are commonly assumed to be temporally local. Here, we propose that the combination of temporally local STDP and a multiplicative synaptic normalization mechanism is sufficient to explain the alignment of parallel synapses. To address this issue, we introduce three increasingly complex models: First, we model the idealized interaction of STDP and synaptic normalization in a single neuron as a simple stochastic process and derive analytically that the alignment effect can be described by a so-called Kesten process. From this we can derive that synaptic efficacy alignment requires potentiation-dominated learning regimes. We verify these conditions in a single-neuron model with independent spiking activities but more realistic synapses. As expected, we only observe synaptic efficacy alignment for long-term potentiation-biased STDP. Finally, we explore how well the findings transfer to recurrent neural networks where the learning mechanisms interact with the correlated activity of the network. We find that due to the self-reinforcing correlations in recurrent circuits under STDP, alignment occurs for both long-term potentiation- and depression-biased STDP, because the learning will be potentiation dominated in both cases due to the potentiating events induced by correlated activity. This is in line with recent results demonstrating a dominance of potentiation over depression during waking and normalization during sleep. This leads us to predict that individual spine pairs will be more similar after sleep compared to after sleep deprivation. In conclusion, we show that synaptic normalization in conjunction with coordinated potentiation--in this case, from STDP in the presence of correlated pre- and post-synaptic activity--naturally leads to an alignment of parallel synapses.

A greedy, graph-based algorithm for the alignment of multiple homologous gene lists.

PubMed

Fostier, Jan; Proost, Sebastian; Dhoedt, Bart; Saeys, Yvan; Demeester, Piet; Van de Peer, Yves; Vandepoele, Klaas

2011-03-15

Many comparative genomics studies rely on the correct identification of homologous genomic regions using accurate alignment tools. In such case, the alphabet of the input sequences consists of complete genes, rather than nucleotides or amino acids. As optimal multiple sequence alignment is computationally impractical, a progressive alignment strategy is often employed. However, such an approach is susceptible to the propagation of alignment errors in early pairwise alignment steps, especially when dealing with strongly diverged genomic regions. In this article, we present a novel accurate and efficient greedy, graph-based algorithm for the alignment of multiple homologous genomic segments, represented as ordered gene lists. Based on provable properties of the graph structure, several heuristics are developed to resolve local alignment conflicts that occur due to gene duplication and/or rearrangement events on the different genomic segments. The performance of the algorithm is assessed by comparing the alignment results of homologous genomic segments in Arabidopsis thaliana to those obtained by using both a progressive alignment method and an earlier graph-based implementation. Especially for datasets that contain strongly diverged segments, the proposed method achieves a substantially higher alignment accuracy, and proves to be sufficiently fast for large datasets including a few dozens of eukaryotic genomes. http://bioinformatics.psb.ugent.be/software. The algorithm is implemented as a part of the i-ADHoRe 3.0 package.

Prostate lesion detection and localization based on locality alignment discriminant analysis

NASA Astrophysics Data System (ADS)

Lin, Mingquan; Chen, Weifu; Zhao, Mingbo; Gibson, Eli; Bastian-Jordan, Matthew; Cool, Derek W.; Kassam, Zahra; Chow, Tommy W. S.; Ward, Aaron; Chiu, Bernard

2017-03-01

Prostatic adenocarcinoma is one of the most commonly occurring cancers among men in the world, and it also the most curable cancer when it is detected early. Multiparametric MRI (mpMRI) combines anatomic and functional prostate imaging techniques, which have been shown to produce high sensitivity and specificity in cancer localization, which is important in planning biopsies and focal therapies. However, in previous investigations, lesion localization was achieved mainly by manual segmentation, which is time-consuming and prone to observer variability. Here, we developed an algorithm based on locality alignment discriminant analysis (LADA) technique, which can be considered as a version of linear discriminant analysis (LDA) localized to patches in the feature space. Sensitivity, specificity and accuracy generated by the proposed algorithm in five prostates by LADA were 52.2%, 89.1% and 85.1% respectively, compared to 31.3%, 85.3% and 80.9% generated by LDA. The delineation accuracy attainable by this tool has a potential in increasing the cancer detection rate in biopsies and in minimizing collateral damage of surrounding tissues in focal therapies.

Isolation and bioinformatics analysis of differentially methylated genomic fragments in human gastric cancer

PubMed Central

Liao, Ai-Jun; Su, Qi; Wang, Xun; Zeng, Bin; Shi, Wei

2008-01-01

AIM: To isolate and analyze the DNA sequences which are methylated differentially between gastric cancer and normal gastric mucosa. METHODS: The differentially methylated DNA sequences between gastric cancer and normal gastric mucosa were isolated by methylation-sensitive representational difference analysis (MS-RDA). Similarities between the separated fragments and the human genomic DNA were analyzed with Basic Local Alignment Search Tool (BLAST). RESULTS: Three differentially methylated DNA sequences were obtained, two of which have been accepted by GenBank. The accession numbers are AY887106 and AY887107. AY887107 was highly similar to the 11th exon of LOC440683 (98%), 3’ end of LOC440887 (99%), and promoter and exon regions of DRD5 (94%). AY887106 was consistent (98%) with a CpG island in ribosomal RNA isolated from colorectal cancer by Minoru Toyota in 1999. CONCLUSION: The methylation degree is different between gastric cancer and normal gastric mucosa. The differentially methylated DNA sequences can be isolated effectively by MS-RDA. PMID:18322944

Investigating the nature of chiral near-field interactions

NASA Astrophysics Data System (ADS)

Barr, Lauren E.; Horsley, Simon A. R.; Hooper, Ian R.; Eager, Jake K.; Gallagher, Cameron P.; Hornett, Samuel M.; Hibbins, Alastair P.; Hendry, Euan

2018-04-01

In recent years, there have been reports of enhanced chiroptical interactions in the near-fields of antennas, postulated to be mediated by high spatial gradients in the electromagnetic fields. Here, using gigahertz experimentation, we investigate the nature of the chiral near-field generated by an array of staggered-rod antennas through its interaction with an array of aligned, subwavelength metallic helices. This allows us to eliminate many potential origins of enhancements, such as those associated with plasmon-exciton interactions, and search solely for enhancements due to the high spatial gradients in the chirality of the fields around chiral antennas (so-called `superchiral fields'). By comparing the strength of the chiral interaction with our helices to that of a homogeneous chiral layer with effective material parameters, we find that the strength of this chiral interaction can be predicted using a completely local effective medium approximation. This suggests no obvious enhancement in the chiral interaction in the near-field and indicates that nonlocal interactions are negligible in this system.

Molecular Detection of Rickettsia felis in Different Flea Species from Caldas, Colombia

PubMed Central

Ramírez-Hernández, Alejandro; Montoya, Viviana; Martínez, Alejandra; Pérez, Jorge E.; Mercado, Marcela; de la Ossa, Alberto; Vélez, Carolina; Estrada, Gloria; Correa, Maria I.; Duque, Laura; Ariza, Juan S.; Henao, Cesar; Valbuena, Gustavo; Hidalgo, Marylin

2013-01-01

Rickettsioses caused by Rickettsia felis are an emergent global threat. Historically, the northern region of the province of Caldas in Colombia has reported murine typhus cases, and recently, serological studies confirmed high seroprevalence for both R. felis and R. typhi. In the present study, fleas from seven municipalities were collected from dogs, cats, and mice. DNA was extracted and amplified by polymerase chain reaction (PCR) to identify gltA, ompB, and 17kD genes. Positive samples were sequenced to identify the species of Rickettsia. Of 1,341 fleas, Ctenocephalides felis was the most prevalent (76.7%). Positive PCR results in the three genes were evidenced in C. felis (minimum infection rates; 5.3%), C. canis (9.2%), and Pulex irritans (10.0%). Basic Local Alignment Search Tool (BLAST) analyses of sequences showed high identity values (> 98%) with R. felis, and all were highly related by phylogenetic analyses. This work shows the first detection of R. felis in fleas collected from animals in Colombia. PMID:23878183

A Hough transform global probabilistic approach to multiple-subject diffusion MRI tractography.

PubMed

Aganj, Iman; Lenglet, Christophe; Jahanshad, Neda; Yacoub, Essa; Harel, Noam; Thompson, Paul M; Sapiro, Guillermo

2011-08-01

A global probabilistic fiber tracking approach based on the voting process provided by the Hough transform is introduced in this work. The proposed framework tests candidate 3D curves in the volume, assigning to each one a score computed from the diffusion images, and then selects the curves with the highest scores as the potential anatomical connections. The algorithm avoids local minima by performing an exhaustive search at the desired resolution. The technique is easily extended to multiple subjects, considering a single representative volume where the registered high-angular resolution diffusion images (HARDI) from all the subjects are non-linearly combined, thereby obtaining population-representative tracts. The tractography algorithm is run only once for the multiple subjects, and no tract alignment is necessary. We present experimental results on HARDI volumes, ranging from simulated and 1.5T physical phantoms to 7T and 4T human brain and 7T monkey brain datasets. Copyright © 2011 Elsevier B.V. All rights reserved.

Two cases of Cokeromyces recurvatus in liquid-based Papanicolaou tests and a review of the literature.

PubMed

Odronic, Shelley I; Scheidemantel, Thomas; Tuohy, Marion J; Chute, Deborah; Procop, Gary W; Booth, Christine N

2012-12-01

We present 2 cases of Cokeromyces recurvatus in routine, liquid-based Papanicolaou tests (ThinPrep). Patient 1 is a healthy, asymptomatic, 26-year-old woman with no pertinent past medical history. Patient 2 is a healthy, asymptomatic, 47-year-old woman with no pertinent past medical history. The Papanicolaou tests from both patients showed many fungal-like elements as globose, yeastlike forms measuring 10 to 30 µm in diameter with multiple, narrowly attached apparent "daughter" buds. This morphology was consistent with Paracoccidioides brasiliensis. However, broad-range fungal polymerase chain reaction and deoxyribonucleic acid sequence analysis performed with GenBank Basic Local Alignment Search Tool showed an exact match for C recurvatus. Our cases highlight the importance of molecular techniques to prevent misdiagnosis of C recurvatus as P brasiliensis, based on morphology alone. There have been 8 previously published cases of C recurvatus infection in humans, 3 of which were reported in the female genital tract.

Nonprofit hospitals' approach to community health needs assessment.

PubMed

Pennel, Cara L; McLeroy, Kenneth R; Burdine, James N; Matarrita-Cascante, David

2015-03-01

We sought a better understanding of how nonprofit hospitals are fulfilling the community health needs assessment (CHNA) provision of the 2010 Patient Protection and Affordable Care Act to conduct CHNAs and develop CHNA and implementation strategies reports. Through an Internet search of an estimated 179 nonprofit hospitals in Texas conducted between December 1, 2013, and January 5, 2014, we identified and reviewed 95 CHNA and implementation strategies reports. We evaluated and scored reports with specific criteria. We analyzed hospital-related and other report characteristics to understand relationships with report quality. There was wide-ranging diversity in CHNA approaches and report quality. Consultant-led CHNA processes and collaboration with local health departments were associated with higher-quality reports. At the time of this study, the Internal Revenue Service had not yet issued the final regulations for the CHNA requirement. This provides an opportunity to strengthen the CHNA guidance for the final regulations, clarify the purpose of the assessment and planning process and reports, and better align assessment and planning activities through a public health framework.

An analysis of iterated local search for job-shop scheduling.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2003-08-01

Iterated local search, or ILS, is among the most straightforward meta-heuristics for local search. ILS employs both small-step and large-step move operators. Search proceeds via iterative modifications to a single solution, in distinct alternating phases. In the first phase, local neighborhood search (typically greedy descent) is used in conjunction with the small-step operator to transform solutions into local optima. In the second phase, the large-step operator is applied to generate perturbations to the local optima obtained in the first phase. Ideally, when local neighborhood search is applied to the resulting solution, search will terminate at a different local optimum, i.e.,more » the large-step perturbations should be sufficiently large to enable escape from the attractor basins of local optima. ILS has proven capable of delivering excellent performance on numerous N P-Hard optimization problems. [LMS03]. However, despite its implicity, very little is known about why ILS can be so effective, and under what conditions. The goal of this paper is to advance the state-of-the-art in the analysis of meta-heuristics, by providing answers to this research question. They focus on characterizing both the relationship between the structure of the underlying search space and ILS performance, and the dynamic behavior of ILS. The analysis proceeds in the context of the job-shop scheduling problem (JSP) [Tai94]. They begin by demonstrating that the attractor basins of local optima in the JSP are surprisingly weak, and can be escaped with high probaiblity by accepting a short random sequence of less-fit neighbors. this result is used to develop a new ILS algorithms for the JSP, I-JAR, whose performance is competitive with tabu search on difficult benchmark instances. They conclude by developing a very accurate behavioral model of I-JAR, which yields significant insights into the dynamics of search. The analysis is based on a set of 100 random 10 x 10 problem instances, in addition to some widely used benchmark instances. Both I-JAR and the tabu search algorithm they consider are based on the N1 move operator introduced by van Laarhoven et al. [vLAL92]. The N1 operator induces a connected search space, such that it is always possible to move from an arbitrary solution to an optimal solution; this property is integral to the development of a behavioral model of I-JAR. However, much of the analysis generalizes to other move operators, including that of Nowicki and Smutnick [NS96]. Finally the models are based on the distance between two solutions, which they take as the well-known disjunctive graph distance [MBK99].« less

GOSSIP: a method for fast and accurate global alignment of protein structures.

PubMed

Kifer, I; Nussinov, R; Wolfson, H J

2011-04-01

The database of known protein structures (PDB) is increasing rapidly. This results in a growing need for methods that can cope with the vast amount of structural data. To analyze the accumulating data, it is important to have a fast tool for identifying similar structures and clustering them by structural resemblance. Several excellent tools have been developed for the comparison of protein structures. These usually address the task of local structure alignment, an important yet computationally intensive problem due to its complexity. It is difficult to use such tools for comparing a large number of structures to each other at a reasonable time. Here we present GOSSIP, a novel method for a global all-against-all alignment of any set of protein structures. The method detects similarities between structures down to a certain cutoff (a parameter of the program), hence allowing it to detect similar structures at a much higher speed than local structure alignment methods. GOSSIP compares many structures in times which are several orders of magnitude faster than well-known available structure alignment servers, and it is also faster than a database scanning method. We evaluate GOSSIP both on a dataset of short structural fragments and on two large sequence-diverse structural benchmarks. Our conclusions are that for a threshold of 0.6 and above, the speed of GOSSIP is obtained with no compromise of the accuracy of the alignments or of the number of detected global similarities. A server, as well as an executable for download, are available at http://bioinfo3d.cs.tau.ac.il/gossip/.

Career Pathways: Aligning Public Resources to Support Individual and Regional Economic Advancement in the Knowledge Economy

ERIC Educational Resources Information Center

Jenkins, Davis

2006-01-01

This paper describes career pathways, a framework or approach by which regions can better align publicly supported systems and programs to build a knowledge-economy workforce customized to the needs of local labor markets. A career pathway is a series of connected education and training programs and support services that enable individuals to…

A Real-Time All-Atom Structural Search Engine for Proteins

PubMed Central

Gonzalez, Gabriel; Hannigan, Brett; DeGrado, William F.

2014-01-01

Protein designers use a wide variety of software tools for de novo design, yet their repertoire still lacks a fast and interactive all-atom search engine. To solve this, we have built the Suns program: a real-time, atomic search engine integrated into the PyMOL molecular visualization system. Users build atomic-level structural search queries within PyMOL and receive a stream of search results aligned to their query within a few seconds. This instant feedback cycle enables a new “designability”-inspired approach to protein design where the designer searches for and interactively incorporates native-like fragments from proven protein structures. We demonstrate the use of Suns to interactively build protein motifs, tertiary interactions, and to identify scaffolds compatible with hot-spot residues. The official web site and installer are located at http://www.degradolab.org/suns/ and the source code is hosted at https://github.com/godotgildor/Suns (PyMOL plugin, BSD license), https://github.com/Gabriel439/suns-cmd (command line client, BSD license), and https://github.com/Gabriel439/suns-search (search engine server, GPLv2 license). PMID:25079944

A real-time all-atom structural search engine for proteins.

PubMed

Gonzalez, Gabriel; Hannigan, Brett; DeGrado, William F

2014-07-01

Protein designers use a wide variety of software tools for de novo design, yet their repertoire still lacks a fast and interactive all-atom search engine. To solve this, we have built the Suns program: a real-time, atomic search engine integrated into the PyMOL molecular visualization system. Users build atomic-level structural search queries within PyMOL and receive a stream of search results aligned to their query within a few seconds. This instant feedback cycle enables a new "designability"-inspired approach to protein design where the designer searches for and interactively incorporates native-like fragments from proven protein structures. We demonstrate the use of Suns to interactively build protein motifs, tertiary interactions, and to identify scaffolds compatible with hot-spot residues. The official web site and installer are located at http://www.degradolab.org/suns/ and the source code is hosted at https://github.com/godotgildor/Suns (PyMOL plugin, BSD license), https://github.com/Gabriel439/suns-cmd (command line client, BSD license), and https://github.com/Gabriel439/suns-search (search engine server, GPLv2 license).

Robust face alignment under occlusion via regional predictive power estimation.

PubMed

Heng Yang; Xuming He; Xuhui Jia; Patras, Ioannis

2015-08-01

Face alignment has been well studied in recent years, however, when a face alignment model is applied on facial images with heavy partial occlusion, the performance deteriorates significantly. In this paper, instead of training an occlusion-aware model with visibility annotation, we address this issue via a model adaptation scheme that uses the result of a local regression forest (RF) voting method. In the proposed scheme, the consistency of the votes of the local RF in each of several oversegmented regions is used to determine the reliability of predicting the location of the facial landmarks. The latter is what we call regional predictive power (RPP). Subsequently, we adapt a holistic voting method (cascaded pose regression based on random ferns) by putting weights on the votes of each fern according to the RPP of the regions used in the fern tests. The proposed method shows superior performance over existing face alignment models in the most challenging data sets (COFW and 300-W). Moreover, it can also estimate with high accuracy (72.4% overlap ratio) which image areas belong to the face or nonface objects, on the heavily occluded images of the COFW data set, without explicit occlusion modeling.

3D photo mosaicing of Tagiri shallow vent field by an autonomous underwater vehicle (3rd report) - Mosaicing method based on navigation data and visual features -

NASA Astrophysics Data System (ADS)

Maki, Toshihiro; Ura, Tamaki; Singh, Hanumant; Sakamaki, Takashi

Large-area seafloor imaging will bring significant benefits to various fields such as academics, resource survey, marine development, security, and search-and-rescue. The authors have proposed a navigation method of an autonomous underwater vehicle for seafloor imaging, and verified its performance through mapping tubeworm colonies with the area of 3,000 square meters using the AUV Tri-Dog 1 at Tagiri vent field, Kagoshima bay in Japan (Maki et al., 2008, 2009). This paper proposes a post-processing method to build a natural photo mosaic from a number of pictures taken by an underwater platform. The method firstly removes lens distortion, invariances of color and lighting from each image, and then ortho-rectification is performed based on camera pose and seafloor estimated by navigation data. The image alignment is based on both navigation data and visual characteristics, implemented as an expansion of the image based method (Pizarro et al., 2003). Using the two types of information realizes an image alignment that is consistent both globally and locally, as well as making the method applicable to data sets with little visual keys. The method was evaluated using a data set obtained by the AUV Tri-Dog 1 at the vent field in Sep. 2009. A seamless, uniformly illuminated photo mosaic covering the area of around 500 square meters was created from 391 pictures, which covers unique features of the field such as bacteria mats and tubeworm colonies.

Tweaked residual convolutional network for face alignment

NASA Astrophysics Data System (ADS)

Du, Wenchao; Li, Ke; Zhao, Qijun; Zhang, Yi; Chen, Hu

2017-08-01

We propose a novel Tweaked Residual Convolutional Network approach for face alignment with two-level convolutional networks architecture. Specifically, the first-level Tweaked Convolutional Network (TCN) module predicts the landmark quickly but accurately enough as a preliminary, by taking low-resolution version of the detected face holistically as the input. The following Residual Convolutional Networks (RCN) module progressively refines the landmark by taking as input the local patch extracted around the predicted landmark, particularly, which allows the Convolutional Neural Network (CNN) to extract local shape-indexed features to fine tune landmark position. Extensive evaluations show that the proposed Tweaked Residual Convolutional Network approach outperforms existing methods.

Feature-based Alignment of Volumetric Multi-modal Images

PubMed Central

Toews, Matthew; Zöllei, Lilla; Wells, William M.

2014-01-01

This paper proposes a method for aligning image volumes acquired from different imaging modalities (e.g. MR, CT) based on 3D scale-invariant image features. A novel method for encoding invariant feature geometry and appearance is developed, based on the assumption of locally linear intensity relationships, providing a solution to poor repeatability of feature detection in different image modalities. The encoding method is incorporated into a probabilistic feature-based model for multi-modal image alignment. The model parameters are estimated via a group-wise alignment algorithm, that iteratively alternates between estimating a feature-based model from feature data, then realigning feature data to the model, converging to a stable alignment solution with few pre-processing or pre-alignment requirements. The resulting model can be used to align multi-modal image data with the benefits of invariant feature correspondence: globally optimal solutions, high efficiency and low memory usage. The method is tested on the difficult RIRE data set of CT, T1, T2, PD and MP-RAGE brain images of subjects exhibiting significant inter-subject variability due to pathology. PMID:24683955

Exact calculation of distributions on integers, with application to sequence alignment.

PubMed

Newberg, Lee A; Lawrence, Charles E

2009-01-01

Computational biology is replete with high-dimensional discrete prediction and inference problems. Dynamic programming recursions can be applied to several of the most important of these, including sequence alignment, RNA secondary-structure prediction, phylogenetic inference, and motif finding. In these problems, attention is frequently focused on some scalar quantity of interest, a score, such as an alignment score or the free energy of an RNA secondary structure. In many cases, score is naturally defined on integers, such as a count of the number of pairing differences between two sequence alignments, or else an integer score has been adopted for computational reasons, such as in the test of significance of motif scores. The probability distribution of the score under an appropriate probabilistic model is of interest, such as in tests of significance of motif scores, or in calculation of Bayesian confidence limits around an alignment. Here we present three algorithms for calculating the exact distribution of a score of this type; then, in the context of pairwise local sequence alignments, we apply the approach so as to find the alignment score distribution and Bayesian confidence limits.

Genome alignment with graph data structures: a comparison

PubMed Central

2014-01-01

Background Recent advances in rapid, low-cost sequencing have opened up the opportunity to study complete genome sequences. The computational approach of multiple genome alignment allows investigation of evolutionarily related genomes in an integrated fashion, providing a basis for downstream analyses such as rearrangement studies and phylogenetic inference. Graphs have proven to be a powerful tool for coping with the complexity of genome-scale sequence alignments. The potential of graphs to intuitively represent all aspects of genome alignments led to the development of graph-based approaches for genome alignment. These approaches construct a graph from a set of local alignments, and derive a genome alignment through identification and removal of graph substructures that indicate errors in the alignment. Results We compare the structures of commonly used graphs in terms of their abilities to represent alignment information. We describe how the graphs can be transformed into each other, and identify and classify graph substructures common to one or more graphs. Based on previous approaches, we compile a list of modifications that remove these substructures. Conclusion We show that crucial pieces of alignment information, associated with inversions and duplications, are not visible in the structure of all graphs. If we neglect vertex or edge labels, the graphs differ in their information content. Still, many ideas are shared among all graph-based approaches. Based on these findings, we outline a conceptual framework for graph-based genome alignment that can assist in the development of future genome alignment tools. PMID:24712884

Versatile alignment layer method for new types of liquid crystal photonic devices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Finnemeyer, V.; Bryant, D.; Lu, L.

2015-07-21

Liquid crystal photonic devices are becoming increasingly popular. These devices often present a challenge when it comes to creating a robust alignment layer in pre-assembled cells. In this paper, we describe a method of infusing a dye into a microcavity to produce an effective photo-definable alignment layer. However, previous research on such alignment layers has shown that they have limited stability, particularly against subsequent light exposure. As such, we further describe a method of utilizing a pre-polymer, infused into the microcavity along with the liquid crystal, to provide photostability. We demonstrate that the polymer layer, formed under ultraviolet irradiation ofmore » liquid crystal cells, has been effectively localized to a thin region near the substrate surface and provides a significant improvement in the photostability of the liquid crystal alignment. This versatile alignment layer method, capable of being utilized in devices from the described microcavities to displays, offers significant promise for new photonics applications.« less

Unsupervised image matching based on manifold alignment.

PubMed

Pei, Yuru; Huang, Fengchun; Shi, Fuhao; Zha, Hongbin

2012-08-01

This paper challenges the issue of automatic matching between two image sets with similar intrinsic structures and different appearances, especially when there is no prior correspondence. An unsupervised manifold alignment framework is proposed to establish correspondence between data sets by a mapping function in the mutual embedding space. We introduce a local similarity metric based on parameterized distance curves to represent the connection of one point with the rest of the manifold. A small set of valid feature pairs can be found without manual interactions by matching the distance curve of one manifold with the curve cluster of the other manifold. To avoid potential confusions in image matching, we propose an extended affine transformation to solve the nonrigid alignment in the embedding space. The comparatively tight alignments and the structure preservation can be obtained simultaneously. The point pairs with the minimum distance after alignment are viewed as the matchings. We apply manifold alignment to image set matching problems. The correspondence between image sets of different poses, illuminations, and identities can be established effectively by our approach.

The effects of window shape and reticle presence on performance in a vertical alignment task

NASA Technical Reports Server (NTRS)

Rosenberg, Erika L.; Haines, Richard F.; Jordan, Kevin

1989-01-01

This study was conducted to evaluate the effect of selected interior work-station orientational cuing upon the ability to align a target image with local vertical in the frontal plane. Angular error from gravitational vertical in an alignment task was measured for 20 observers viewing through two window shapes (square, round), two initial orientations of a computer-generated space shuttle image, and the presence or absence of a stabilized optical alignment reticle. In terms of overall accuracy, it was found that observer error was significantly smaller for the square window and reticle-present conditions than for the round window and reticle-absent conditions. Response bias data reflected an overall tendency to undershoot and greater variability of response in the round window/no reticle condition. These results suggest that environmental cuing information, such as that provided by square window frames and alignment reticles, may aid in subjective orientation and increase accuracy of response in a Space Station proximity operations alignment task.

Ecology of dark matter haloes - II. Effects of interactions on the alignment of halo pairs

NASA Astrophysics Data System (ADS)

L'Huillier, Benjamin; Park, Changbom; Kim, Juhan

2017-04-01

We use the Horizon Run 4 cosmological N-body simulation to study the effects of distant and close interactions on the alignments of the shapes, spins and orbits of targets haloes with their neighbours, and their dependence on the local density environment and neighbour separation. Interacting targets have a significantly lower spin and higher sphericity and oblateness than all targets. Interacting pairs initially have antiparallel spins, but the spins develop parallel alignment as time goes on. Neighbours tend to evolve in the plane of rotation of the target, and in the direction of the major axis of prolate haloes. Moreover, interactions are preferentially radial, while pairs with non-radial orbits are preferentially prograde. The alignment signals are stronger at high mass and for close separations, and independent of the large-scale density. Positive alignment signals are found at redshifts up to 4, and increase with decreasing redshifts. Moreover, the orbits tend to become prograde at low redshift, while no alignment is found at high redshift (z = 4).

Transients in the Local Universe : Systematically Searching the Gap between Novae and Supernovae

NASA Astrophysics Data System (ADS)

Kasliwal, Mansi M.; Kulkarni, S.

2009-05-01

We present three systematic transient searches of the glaring luminosity gap between brightest novae (Mv = -10) and faintest supernovae (Mv = -16). The least explored regime in this gap, with several intriguing theoretical predictions, is short-duration transients (<10; days). Our searches are targeted and designed to be deeper and faster cadence (1-day) than traditional supernova searches and probe a larger volume compared to nova searches. We summarize discoveries from our search of the nearest, brightest galaxies (P60-FasTING, Fast Transients In Nearest Galaxies) and nearest galaxy clusters (CFHT-COVET, Coma and Virgo Exploration for Transients). We also highlight first results from the Palomar Transient Factory which targets local (<200 Mpc) luminosity concentrations. We suggest that building a complete inventory of transients in the local universe is timely. These transients are potential electromagnetic counterparts to next-generation instruments (e.g. Advanced LIGO, Auger, ICECUBE) which are also limited in sensitivity (due to intrumental or physical effects) to the local universe.

Local weather is associated with rates of online searches for musculoskeletal pain symptoms.

PubMed

Telfer, Scott; Obradovich, Nick

2017-01-01

Weather conditions are commonly believed to influence musculoskeletal pain, however the evidence for this is mixed. This study aimed to examine the relationship between local meteorological conditions and online search trends for terms related to knee pain, hip pain, and arthritis. Five years of relative online search volumes for these terms were obtained for the 50 most populous cities in the contiguous United States, along with corresponding local weather data for temperature, relative humidity, barometric pressure, and precipitation. Methods from the climate econometrics literature were used to assess the casual impact of these meteorological variables on the relative volumes of searches for pain. For temperatures between -5°C and 30°C, search volumes for hip pain increased by 12 index points, and knee pain increased by 18 index points. Precipitation had a negative effect on search volumes for these terms. At temperatures >30°C, search volumes for arthritis related pain decreased by 7 index points. These patterns were not seen for pain searches unrelated to the musculoskeletal system. In summary, selected local weather conditions are significantly associated with online search volumes for specific musculoskeletal pain symptoms. We believe the predominate driver for this to be the relative changes in physical activity levels associated with meteorological conditions.

12-GHz thin-film transistors on transferrable silicon nanomembranes for high-performance flexible electronics.

PubMed

Sun, Lei; Qin, Guoxuan; Seo, Jung-Hun; Celler, George K; Zhou, Weidong; Ma, Zhenqiang

2010-11-22

Multigigahertz flexible electronics are attractive and have broad applications. A gate-after-source/drain fabrication process using preselectively doped single-crystal silicon nanomembranes (SiNM) is an effective approach to realizing high device speed. However, further downscaling this approach has become difficult in lithography alignment. In this full paper, a local alignment scheme in combination with more accurate SiNM transfer measures for minimizing alignment errors is reported. By realizing 1 μm channel alignment for the SiNMs on a soft plastic substrate, thin-film transistors with a record speed of 12 GHz maximum oscillation frequency are demonstrated. These results indicate the great potential of properly processed SiNMs for high-performance flexible electronics.

Intentions and Perceptions: In Search of Alignment

ERIC Educational Resources Information Center

Sindberg, Laura K.

2009-01-01

Teachers plan for instruction in band, choir, and orchestra; this typically includes selecting repertoire and planning outcomes and strategies for achieving those goals with a vision toward excellent musical performance. Teachers in school music ensembles plan instruction that will lead to student learning. In the ensemble setting, this learning…

Connecting Ed & Tech: Partnering to Drive Student Outcomes

ERIC Educational Resources Information Center

Arnett, Thomas

2016-01-01

All too often, the connection between teachers and technology falls flat. Pioneering schools and educators search for technology to support new instructional models, only to find that existing options do not align with their evolving classroom practices. This case study describes how Leadership Public Schools (LPS), a charter school management…

Global faculty development: lessons learned from the Foundation for Advancement of International Medical Education and Research (FAIMER) initiatives.

PubMed

Burdick, William P

2014-08-01

Foundation for Advancement of International Medical Education and Research (FAIMER) faculty development programs have operated since 2001 and are designed to overcome many of the challenges inherent in global health collaborations, including alignment with local needs, avoiding persistent dependency, and development of trust. FAIMER fellowship programs, developed for midcareer faculty members in all health professions from around the world, share goals of strengthening knowledge and skills in education leadership, education methods, and project management and evaluation. Building community is another explicit goal that allows participants to support and learn from each other.The author recommends several practices for successful international collaborations based on 13 years of experience with FAIMER fellowships. These include using authentic education projects to maintain alignment with local needs and apply newly acquired knowledge and skills, teaching leadership across cultures with careful communication and adaptation of concepts to local environments, cultivating a strong field of health professions education to promote diffusion of ideas and advocate for policy change, intentionally promoting field development and leadership to reduce dependency, giving generously of time and resources, learning from others as much as teaching others, and recognizing that effective partnerships revolve around personal relationships to build trust. These strategies have enabled the FAIMER fellowship programs to stay aligned with local needs, reduce dependency, and maintain trust.

Faster sequence homology searches by clustering subsequences.

PubMed

Suzuki, Shuji; Kakuta, Masanori; Ishida, Takashi; Akiyama, Yutaka

2015-04-15

Sequence homology searches are used in various fields. New sequencing technologies produce huge amounts of sequence data, which continuously increase the size of sequence databases. As a result, homology searches require large amounts of computational time, especially for metagenomic analysis. We developed a fast homology search method based on database subsequence clustering, and implemented it as GHOSTZ. This method clusters similar subsequences from a database to perform an efficient seed search and ungapped extension by reducing alignment candidates based on triangle inequality. The database subsequence clustering technique achieved an ∼2-fold increase in speed without a large decrease in search sensitivity. When we measured with metagenomic data, GHOSTZ is ∼2.2-2.8 times faster than RAPSearch and is ∼185-261 times faster than BLASTX. The source code is freely available for download at http://www.bi.cs.titech.ac.jp/ghostz/ akiyama@cs.titech.ac.jp Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press.

G‐LoSA: An efficient computational tool for local structure‐centric biological studies and drug design

PubMed Central

2016-01-01

Abstract Molecular recognition by protein mostly occurs in a local region on the protein surface. Thus, an efficient computational method for accurate characterization of protein local structural conservation is necessary to better understand biology and drug design. We present a novel local structure alignment tool, G‐LoSA. G‐LoSA aligns protein local structures in a sequence order independent way and provides a GA‐score, a chemical feature‐based and size‐independent structure similarity score. Our benchmark validation shows the robust performance of G‐LoSA to the local structures of diverse sizes and characteristics, demonstrating its universal applicability to local structure‐centric comparative biology studies. In particular, G‐LoSA is highly effective in detecting conserved local regions on the entire surface of a given protein. In addition, the applications of G‐LoSA to identifying template ligands and predicting ligand and protein binding sites illustrate its strong potential for computer‐aided drug design. We hope that G‐LoSA can be a useful computational method for exploring interesting biological problems through large‐scale comparison of protein local structures and facilitating drug discovery research and development. G‐LoSA is freely available to academic users at http://im.compbio.ku.edu/GLoSA/. PMID:26813336

G-LoSA: An efficient computational tool for local structure-centric biological studies and drug design.

PubMed

Lee, Hui Sun; Im, Wonpil

2016-04-01

Molecular recognition by protein mostly occurs in a local region on the protein surface. Thus, an efficient computational method for accurate characterization of protein local structural conservation is necessary to better understand biology and drug design. We present a novel local structure alignment tool, G-LoSA. G-LoSA aligns protein local structures in a sequence order independent way and provides a GA-score, a chemical feature-based and size-independent structure similarity score. Our benchmark validation shows the robust performance of G-LoSA to the local structures of diverse sizes and characteristics, demonstrating its universal applicability to local structure-centric comparative biology studies. In particular, G-LoSA is highly effective in detecting conserved local regions on the entire surface of a given protein. In addition, the applications of G-LoSA to identifying template ligands and predicting ligand and protein binding sites illustrate its strong potential for computer-aided drug design. We hope that G-LoSA can be a useful computational method for exploring interesting biological problems through large-scale comparison of protein local structures and facilitating drug discovery research and development. G-LoSA is freely available to academic users at http://im.compbio.ku.edu/GLoSA/. © 2016 The Protein Society.

Self-organized sorting limits behavioral variability in swarms

PubMed Central

Copenhagen, Katherine; Quint, David A.; Gopinathan, Ajay

2016-01-01

Swarming is a phenomenon where collective motion arises from simple local interactions between typically identical individuals. Here, we investigate the effects of variability in behavior among the agents in finite swarms with both alignment and cohesive interactions. We show that swarming is abolished above a critical fraction of non-aligners who do not participate in alignment. In certain regimes, however, swarms above the critical threshold can dynamically reorganize and sort out excess non-aligners to maintain the average fraction close to the critical value. This persists even in swarms with a distribution of alignment interactions, suggesting a simple, robust and efficient mechanism that allows heterogeneously mixed populations to naturally regulate their composition and remain in a collective swarming state or even differentiate among behavioral phenotypes. We show that, for evolving swarms, this self-organized sorting behavior can couple to the evolutionary dynamics leading to new evolutionarily stable equilibrium populations set by the physical swarm parameters. PMID:27550316

Magnetic Alignment in Carps: Evidence from the Czech Christmas Fish Market

PubMed Central

Hart, Vlastimil; Kušta, Tomáš; Němec, Pavel; Bláhová, Veronika; Ježek, Miloš; Nováková, Petra; Begall, Sabine; Červený, Jaroslav; Hanzal, Vladimír; Malkemper, Erich Pascal; Štípek, Kamil; Vole, Christiane; Burda, Hynek

2012-01-01

While magnetoreception in birds has been studied intensively, the literature on magnetoreception in bony fish, and particularly in non-migratory fish, is quite scarce. We examined alignment of common carps (Cyprinus carpio) at traditional Christmas sale in the Czech Republic. The sample comprised measurements of the directional bearings in 14,537 individual fish, distributed among 80 large circular plastic tubs, at 25 localities in the Czech Republic, during 817 sampling sessions, on seven subsequent days in December 2011. We found that carps displayed a statistically highly significant spontaneous preference to align their bodies along the North-South axis. In the absence of any other common orientation cues which could explain this directional preference, we attribute the alignment of the fish to the geomagnetic field lines. It is apparent that the display of magnetic alignment is a simple experimental paradigm of great heuristic potential. PMID:23227241

Self-organized sorting limits behavioral variability in swarms

NASA Astrophysics Data System (ADS)

Copenhagen, Katherine; Quint, David A.; Gopinathan, Ajay

2016-08-01

Swarming is a phenomenon where collective motion arises from simple local interactions between typically identical individuals. Here, we investigate the effects of variability in behavior among the agents in finite swarms with both alignment and cohesive interactions. We show that swarming is abolished above a critical fraction of non-aligners who do not participate in alignment. In certain regimes, however, swarms above the critical threshold can dynamically reorganize and sort out excess non-aligners to maintain the average fraction close to the critical value. This persists even in swarms with a distribution of alignment interactions, suggesting a simple, robust and efficient mechanism that allows heterogeneously mixed populations to naturally regulate their composition and remain in a collective swarming state or even differentiate among behavioral phenotypes. We show that, for evolving swarms, this self-organized sorting behavior can couple to the evolutionary dynamics leading to new evolutionarily stable equilibrium populations set by the physical swarm parameters.

Multi-subject Manifold Alignment of Functional Network Structures via Joint Diagonalization.

PubMed

Nenning, Karl-Heinz; Kollndorfer, Kathrin; Schöpf, Veronika; Prayer, Daniela; Langs, Georg

2015-01-01

Functional magnetic resonance imaging group studies rely on the ability to establish correspondence across individuals. This enables location specific comparison of functional brain characteristics. Registration is often based on morphology and does not take variability of functional localization into account. This can lead to a loss of specificity, or confounds when studying diseases. In this paper we propose multi-subject functional registration by manifold alignment via coupled joint diagonalization. The functional network structure of each subject is encoded in a diffusion map, where functional relationships are decoupled from spatial position. Two-step manifold alignment estimates initial correspondences between functionally equivalent regions. Then, coupled joint diagonalization establishes common eigenbases across all individuals, and refines the functional correspondences. We evaluate our approach on fMRI data acquired during a language paradigm. Experiments demonstrate the benefits in matching accuracy achieved by coupled joint diagonalization compared to previously proposed functional alignment approaches, or alignment based on structural correspondences.

An Efficient Correction Algorithm for Eliminating Image Misalignment Effects on Co-Phasing Measurement Accuracy for Segmented Active Optics Systems

PubMed Central

Yue, Dan; Xu, Shuyan; Nie, Haitao; Wang, Zongyang

2016-01-01

The misalignment between recorded in-focus and out-of-focus images using the Phase Diversity (PD) algorithm leads to a dramatic decline in wavefront detection accuracy and image recovery quality for segmented active optics systems. This paper demonstrates the theoretical relationship between the image misalignment and tip-tilt terms in Zernike polynomials of the wavefront phase for the first time, and an efficient two-step alignment correction algorithm is proposed to eliminate these misalignment effects. This algorithm processes a spatial 2-D cross-correlation of the misaligned images, revising the offset to 1 or 2 pixels and narrowing the search range for alignment. Then, it eliminates the need for subpixel fine alignment to achieve adaptive correction by adding additional tip-tilt terms to the Optical Transfer Function (OTF) of the out-of-focus channel. The experimental results demonstrate the feasibility and validity of the proposed correction algorithm to improve the measurement accuracy during the co-phasing of segmented mirrors. With this alignment correction, the reconstructed wavefront is more accurate, and the recovered image is of higher quality. PMID:26934045

Phylo-mLogo: an interactive and hierarchical multiple-logo visualization tool for alignment of many sequences

PubMed Central

Shih, Arthur Chun-Chieh; Lee, DT; Peng, Chin-Lin; Wu, Yu-Wei

2007-01-01

Background When aligning several hundreds or thousands of sequences, such as epidemic virus sequences or homologous/orthologous sequences of some big gene families, to reconstruct the epidemiological history or their phylogenies, how to analyze and visualize the alignment results of many sequences has become a new challenge for computational biologists. Although there are several tools available for visualization of very long sequence alignments, few of them are applicable to the alignments of many sequences. Results A multiple-logo alignment visualization tool, called Phylo-mLogo, is presented in this paper. Phylo-mLogo calculates the variabilities and homogeneities of alignment sequences by base frequencies or entropies. Different from the traditional representations of sequence logos, Phylo-mLogo not only displays the global logo patterns of the whole alignment of multiple sequences, but also demonstrates their local homologous logos for each clade hierarchically. In addition, Phylo-mLogo also allows the user to focus only on the analysis of some important, structurally or functionally constrained sites in the alignment selected by the user or by built-in automatic calculation. Conclusion With Phylo-mLogo, the user can symbolically and hierarchically visualize hundreds of aligned sequences simultaneously and easily check the changes of their amino acid sites when analyzing many homologous/orthologous or influenza virus sequences. More information of Phylo-mLogo can be found at URL . PMID:17319966

Alignment in star-debris disc systems seen by Herschel

NASA Astrophysics Data System (ADS)

Greaves, J. S.; Kennedy, G. M.; Thureau, N.; Eiroa, C.; Marshall, J. P.; Maldonado, J.; Matthews, B. C.; Olofsson, G.; Barlow, M. J.; Moro-Martín, A.; Sibthorpe, B.; Absil, O.; Ardila, D. R.; Booth, M.; Broekhoven-Fiene, H.; Brown, D. J. A.; Cameron, A. Collier; del Burgo, C.; Di Francesco, J.; Eislöffel, J.; Duchêne, G.; Ertel, S.; Holland, W. S.; Horner, J.; Kalas, P.; Kavelaars, J. J.; Lestrade, J.-F.; Vican, L.; Wilner, D. J.; Wolf, S.; Wyatt, M. C.

2014-02-01

Many nearby main-sequence stars have been searched for debris using the far-infrared Herschel satellite, within the DEBRIS, DUNES and Guaranteed-Time Key Projects. We discuss here 11 stars of spectral types A-M where the stellar inclination is known and can be compared to that of the spatially resolved dust belts. The discs are found to be well aligned with the stellar equators, as in the case of the Sun's Kuiper belt, and unlike many close-in planets seen in transit surveys. The ensemble of stars here can be fitted with a star-disc tilt of ≲ 10°. These results suggest that proposed mechanisms for tilting the star or disc in fact operate rarely. A few systems also host imaged planets, whose orbits at tens of au are aligned with the debris discs, contrary to what might be expected in models where external perturbers induce tilts.

Rapid Threat Organism Recognition Pipeline

DOE Office of Scientific and Technical Information (OSTI.GOV)

Williams, Kelly P.; Solberg, Owen D.; Schoeniger, Joseph S.

2013-05-07

The RAPTOR computational pipeline identifies microbial nucleic acid sequences present in sequence data from clinical samples. It takes as input raw short-read genomic sequence data (in particular, the type generated by the Illumina sequencing platforms) and outputs taxonomic evaluation of detected microbes in various human-readable formats. This software was designed to assist in the diagnosis or characterization of infectious disease, by detecting pathogen sequences in nucleic acid sequence data from clinical samples. It has also been applied in the detection of algal pathogens, when algal biofuel ponds became unproductive. RAPTOR first trims and filters genomic sequence reads based on qualitymore » and related considerations, then performs a quick alignment to the human (or other host) genome to filter out host sequences, then performs a deeper search against microbial genomes. Alignment to a protein sequence database is optional. Alignment results are summarized and placed in a taxonomic framework using the Lowest Common Ancestor algorithm.« less

Darwin v. 2.0: an interpreted computer language for the biosciences.

PubMed

Gonnet, G H; Hallett, M T; Korostensky, C; Bernardin, L

2000-02-01

We announce the availability of the second release of Darwin v. 2.0, an interpreted computer language especially tailored to researchers in the biosciences. The system is a general tool applicable to a wide range of problems. This second release improves Darwin version 1.6 in several ways: it now contains (1) a larger set of libraries touching most of the classical problems from computational biology (pairwise alignment, all versus all alignments, tree construction, multiple sequence alignment), (2) an expanded set of general purpose algorithms (search algorithms for discrete problems, matrix decomposition routines, complex/long integer arithmetic operations), (3) an improved language with a cleaner syntax, (4) better on-line help, and (5) a number of fixes to user-reported bugs. Darwin is made available for most operating systems free of char ge from the Computational Biochemistry Research Group (CBRG), reachable at http://chrg.inf.ethz.ch. darwin@inf.ethz.ch

Laboratory simulation of field-aligned currents

NASA Technical Reports Server (NTRS)

Wessel, Frank J.; Rostoker, Norman

1993-01-01

A summary of progress during the period Apr. 1992 to Mar. 1993 is provided. Objectives of the research are (1) to simulate, via laboratory experiments, the three terms of the field-aligned current equation; (2) to simulate auroral-arc formation processes by configuring the boundary conditions of the experimental chamber and plasma parameters to produce highly localized return currents at the end of a field-aligned current system; and (3) to extrapolate these results, using theoretical and computational techniques, to the problem of magnetospheric-ionospheric coupling and to compare them with published literature signatures of auroral-arc phenomena.

Protein Activity of the Fusarium fujikuroi Rhodopsins CarO and OpsA and Their Relation to Fungus–Plant Interaction

PubMed Central

Adam, Alexander; Deimel, Stephan; Pardo-Medina, Javier; García-Martínez, Jorge; Konte, Tilen; Limón, M. Carmen; Avalos, Javier

2018-01-01

Fungi possess diverse photosensory proteins that allow them to perceive different light wavelengths and to adapt to changing light conditions in their environment. The biological and physiological roles of the green light-sensing rhodopsins in fungi are not yet resolved. The rice plant pathogen Fusarium fujikuroi exhibits two different rhodopsins, CarO and OpsA. CarO was previously characterized as a light-driven proton pump. We further analyzed the pumping behavior of CarO by patch-clamp experiments. Our data show that CarO pumping activity is strongly augmented in the presence of the plant hormone indole-3-acetic acid and in sodium acetate, in a dose-dependent manner under slightly acidic conditions. By contrast, under these and other tested conditions, the Neurospora rhodopsin (NR)-like rhodopsin OpsA did not exhibit any pump activity. Basic local alignment search tool (BLAST) searches in the genomes of ascomycetes revealed the occurrence of rhodopsin-encoding genes mainly in phyto-associated or phytopathogenic fungi, suggesting a possible correlation of the presence of rhodopsins with fungal ecology. In accordance, rice plants infected with a CarO-deficient F. fujikuroi strain showed more severe bakanae symptoms than the reference strain, indicating a potential role of the CarO rhodopsin in the regulation of plant infection by this fungus. PMID:29324661

Predicting the host of influenza viruses based on the word vector.

PubMed

Xu, Beibei; Tan, Zhiying; Li, Kenli; Jiang, Taijiao; Peng, Yousong

2017-01-01

Newly emerging influenza viruses continue to threaten public health. A rapid determination of the host range of newly discovered influenza viruses would assist in early assessment of their risk. Here, we attempted to predict the host of influenza viruses using the Support Vector Machine (SVM) classifier based on the word vector, a new representation and feature extraction method for biological sequences. The results show that the length of the word within the word vector, the sequence type (DNA or protein) and the species from which the sequences were derived for generating the word vector all influence the performance of models in predicting the host of influenza viruses. In nearly all cases, the models built on the surface proteins hemagglutinin (HA) and neuraminidase (NA) (or their genes) produced better results than internal influenza proteins (or their genes). The best performance was achieved when the model was built on the HA gene based on word vectors (words of three-letters long) generated from DNA sequences of the influenza virus. This results in accuracies of 99.7% for avian, 96.9% for human and 90.6% for swine influenza viruses. Compared to the method of sequence homology best-hit searches using the Basic Local Alignment Search Tool (BLAST), the word vector-based models still need further improvements in predicting the host of influenza A viruses.

VRprofile: gene-cluster-detection-based profiling of virulence and antibiotic resistance traits encoded within genome sequences of pathogenic bacteria.

PubMed

Li, Jun; Tai, Cui; Deng, Zixin; Zhong, Weihong; He, Yongqun; Ou, Hong-Yu

2017-01-10

VRprofile is a Web server that facilitates rapid investigation of virulence and antibiotic resistance genes, as well as extends these trait transfer-related genetic contexts, in newly sequenced pathogenic bacterial genomes. The used backend database MobilomeDB was firstly built on sets of known gene cluster loci of bacterial type III/IV/VI/VII secretion systems and mobile genetic elements, including integrative and conjugative elements, prophages, class I integrons, IS elements and pathogenicity/antibiotic resistance islands. VRprofile is thus able to co-localize the homologs of these conserved gene clusters using HMMer or BLASTp searches. With the integration of the homologous gene cluster search module with a sequence composition module, VRprofile has exhibited better performance for island-like region predictions than the other widely used methods. In addition, VRprofile also provides an integrated Web interface for aligning and visualizing identified gene clusters with MobilomeDB-archived gene clusters, or a variety set of bacterial genomes. VRprofile might contribute to meet the increasing demands of re-annotations of bacterial variable regions, and aid in the real-time definitions of disease-relevant gene clusters in pathogenic bacteria of interest. VRprofile is freely available at http://bioinfo-mml.sjtu.edu.cn/VRprofile. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Towards improving searches for optimal phylogenies.

PubMed

Ford, Eric; St John, Katherine; Wheeler, Ward C

2015-01-01

Finding the optimal evolutionary history for a set of taxa is a challenging computational problem, even when restricting possible solutions to be "tree-like" and focusing on the maximum-parsimony optimality criterion. This has led to much work on using heuristic tree searches to find approximate solutions. We present an approach for finding exact optimal solutions that employs and complements the current heuristic methods for finding optimal trees. Given a set of taxa and a set of aligned sequences of characters, there may be subsets of characters that are compatible, and for each such subset there is an associated (possibly partially resolved) phylogeny with edges corresponding to each character state change. These perfect phylogenies serve as anchor trees for our constrained search space. We show that, for sequences with compatible sites, the parsimony score of any tree [Formula: see text] is at least the parsimony score of the anchor trees plus the number of inferred changes between [Formula: see text] and the anchor trees. As the maximum-parsimony optimality score is additive, the sum of the lower bounds on compatible character partitions provides a lower bound on the complete alignment of characters. This yields a region in the space of trees within which the best tree is guaranteed to be found; limiting the search for the optimal tree to this region can significantly reduce the number of trees that must be examined in a search of the space of trees. We analyze this method empirically using four different biological data sets as well as surveying 400 data sets from the TreeBASE repository, demonstrating the effectiveness of our technique in reducing the number of steps in exact heuristic searches for trees under the maximum-parsimony optimality criterion. © The Author(s) 2014. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Clinical practice guidelines within the Southern African development community: a descriptive study of the quality of guideline development and concordance with best evidence for five priority diseases

PubMed Central

2012-01-01

Background Reducing the burden of disease relies on availability of evidence-based clinical practice guidelines (CPGs). There is limited data on availability, quality and content of guidelines within the Southern African Development Community (SADC). This evaluation aims to address this gap in knowledge and provide recommendations for regional guideline development. Methods We prioritised five diseases: HIV in adults, malaria in children and adults, pre-eclampsia, diarrhoea in children and hypertension in primary care. A comprehensive electronic search to locate guidelines was conducted between June and October 2010 and augmented with email contact with SADC Ministries of Health. Independent reviewers used the AGREE II tool to score six quality domains reporting the guideline development process. Alignment of the evidence-base of the guidelines was evaluated by comparing their content with key recommendations from accepted reference guidelines, identified with a content expert, and percentage scores were calculated. Findings We identified 30 guidelines from 13 countries, publication dates ranging from 2003-2010. Overall the 'scope and purpose' and 'clarity and presentation' domains of the AGREE II instrument scored highest, median 58%(range 19-92) and 83%(range 17-100) respectively. 'Stakeholder involvement' followed with median 39%(range 6-75). 'Applicability', 'rigour of development' and 'editorial independence' scored poorly, all below 25%. Alignment with evidence was variable across member states, the lowest scores occurring in older guidelines or where the guideline being evaluated was part of broader primary healthcare CPG rather than a disease-specific guideline. Conclusion This review identified quality gaps and variable alignment with best evidence in available guidelines within SADC for five priority diseases. Future guideline development processes within SADC should better adhere to global reporting norms requiring broader consultation of stakeholders and transparency of process. A regional guideline support committee could harness local capacity to support context appropriate guideline development. PMID:22221856

An integrative review of information systems and terminologies used in local health departments.

PubMed

Olsen, Jeanette; Baisch, Mary Jo

2014-02-01

The purpose of this integrative review based on the published literature was to identify information systems currently being used by local health departments and to determine the extent to which standard terminology was used to communicate data, interventions, and outcomes to improve public health informatics at the local health department (LHD) level and better inform research, policy, and programs. Whittemore and Knafl's integrative review methodology was used. Data were obtained through key word searches of three publication databases and reference lists of retrieved articles and consulting with experts to identify landmark works. The final sample included 45 articles analyzed and synthesized using the matrix method. The results indicated a wide array of information systems were used by LHDs and supported diverse functions aligned with five categories: administration; surveillance; health records; registries; and consumer resources. Detail regarding specific programs being used, location or extent of use, or effectiveness was lacking. The synthesis indicated evidence of growing interest in health information exchange groups, yet few studies described use of data standards or standard terminology in LHDs. Research to address these gaps is needed to provide current, meaningful data that inform public health informatics research, policy, and initiatives at and across the LHD level. Coordination at a state or national level is recommended to collect information efficiently about LHD information systems that will inform improvements while minimizing duplication of efforts and financial burden. Until this happens, efforts to strengthen LHD information systems and policies may be significantly challenged.

GeneBee-net: Internet-based server for analyzing biopolymers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brodsky, L.I.; Ivanov, V.V.; Nikolaev, V.K.

This work describes a network server for searching databanks of biopolymer structures and performing other biocomputing procedures; it is available via direct Internet connection. Basic server procedures are dedicated to homology (similarity) search of sequence and 3D structure of proteins. The homologies found could be used to build multiple alignments, predict protein and RNA secondary structure, and construct phylogenetic trees. In addition to traditional methods of sequence similarity search, the authors propose {open_quotes}non-matrix{close_quotes} (correlational) search. An analogous approach is used to identify regions of similar tertiary structure of proteins. Algorithm concepts and usage examples are presented for new methods. Servicemore » logic is based upon interaction of a client program and server procedures. The client program allows the compilation of queries and the processing of results of an analysis.« less

SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics

PubMed Central

Will, Sebastian; Otto, Christina; Miladi, Milad; Möhl, Mathias; Backofen, Rolf

2015-01-01

Motivation: RNA-Seq experiments have revealed a multitude of novel ncRNAs. The gold standard for their analysis based on simultaneous alignment and folding suffers from extreme time complexity of O(n6). Subsequently, numerous faster ‘Sankoff-style’ approaches have been suggested. Commonly, the performance of such methods relies on sequence-based heuristics that restrict the search space to optimal or near-optimal sequence alignments; however, the accuracy of sequence-based methods breaks down for RNAs with sequence identities below 60%. Alignment approaches like LocARNA that do not require sequence-based heuristics, have been limited to high complexity (≥ quartic time). Results: Breaking this barrier, we introduce the novel Sankoff-style algorithm ‘sparsified prediction and alignment of RNAs based on their structure ensembles (SPARSE)’, which runs in quadratic time without sequence-based heuristics. To achieve this low complexity, on par with sequence alignment algorithms, SPARSE features strong sparsification based on structural properties of the RNA ensembles. Following PMcomp, SPARSE gains further speed-up from lightweight energy computation. Although all existing lightweight Sankoff-style methods restrict Sankoff’s original model by disallowing loop deletions and insertions, SPARSE transfers the Sankoff algorithm to the lightweight energy model completely for the first time. Compared with LocARNA, SPARSE achieves similar alignment and better folding quality in significantly less time (speedup: 3.7). At similar run-time, it aligns low sequence identity instances substantially more accurate than RAF, which uses sequence-based heuristics. Availability and implementation: SPARSE is freely available at http://www.bioinf.uni-freiburg.de/Software/SPARSE. Contact: backofen@informatik.uni-freiburg.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25838465

L-GRAAL: Lagrangian graphlet-based network aligner.

PubMed

Malod-Dognin, Noël; Pržulj, Nataša

2015-07-01

Discovering and understanding patterns in networks of protein-protein interactions (PPIs) is a central problem in systems biology. Alignments between these networks aid functional understanding as they uncover important information, such as evolutionary conserved pathways, protein complexes and functional orthologs. A few methods have been proposed for global PPI network alignments, but because of NP-completeness of underlying sub-graph isomorphism problem, producing topologically and biologically accurate alignments remains a challenge. We introduce a novel global network alignment tool, Lagrangian GRAphlet-based ALigner (L-GRAAL), which directly optimizes both the protein and the interaction functional conservations, using a novel alignment search heuristic based on integer programming and Lagrangian relaxation. We compare L-GRAAL with the state-of-the-art network aligners on the largest available PPI networks from BioGRID and observe that L-GRAAL uncovers the largest common sub-graphs between the networks, as measured by edge-correctness and symmetric sub-structures scores, which allow transferring more functional information across networks. We assess the biological quality of the protein mappings using the semantic similarity of their Gene Ontology annotations and observe that L-GRAAL best uncovers functionally conserved proteins. Furthermore, we introduce for the first time a measure of the semantic similarity of the mapped interactions and show that L-GRAAL also uncovers best functionally conserved interactions. In addition, we illustrate on the PPI networks of baker's yeast and human the ability of L-GRAAL to predict new PPIs. Finally, L-GRAAL's results are the first to show that topological information is more important than sequence information for uncovering functionally conserved interactions. L-GRAAL is coded in C++. Software is available at: http://bio-nets.doc.ic.ac.uk/L-GRAAL/. n.malod-dognin@imperial.ac.uk Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press.

Towards a strategic alignment of public health and primary care practices at local levels - the case of severe and enduring mental illness.

PubMed

Banarsee, Ricky; Kelly, Cornelius; El-Osta, Austen; Thomas, Paul; Brophy, Chris

2018-03-01

The rapidly increasing number of people who have long-term conditions requires a system of coordinated support for self-care throughout the NHS. A system to support self-care needs to be aligned to systems that support shared-care and community development, making it easier for the multidisciplinary teams who provide care to also help patients and populations to help themselves. Public health practitioners need to work closely with clinicians to achieve this. The best place to coordinate this partnership is a community-based coordinating hub, or local health community - a geographic area of about 50,000 population where different contributions to self-care can be aligned. A shared vision for both health and disease management is needed to ensure consistent messaging by all. A three tier system of shared care can help to combine vertical and horizontal integration. This paper uses severe and enduring mental illness as an exemplar to anticipate the design of such a system.

Descriptive Statistics of the Genome: Phylogenetic Classification of Viruses.

PubMed

Hernandez, Troy; Yang, Jie

2016-10-01

The typical process for classifying and submitting a newly sequenced virus to the NCBI database involves two steps. First, a BLAST search is performed to determine likely family candidates. That is followed by checking the candidate families with the pairwise sequence alignment tool for similar species. The submitter's judgment is then used to determine the most likely species classification. The aim of this article is to show that this process can be automated into a fast, accurate, one-step process using the proposed alignment-free method and properly implemented machine learning techniques. We present a new family of alignment-free vectorizations of the genome, the generalized vector, that maintains the speed of existing alignment-free methods while outperforming all available methods. This new alignment-free vectorization uses the frequency of genomic words (k-mers), as is done in the composition vector, and incorporates descriptive statistics of those k-mers' positional information, as inspired by the natural vector. We analyze five different characterizations of genome similarity using k-nearest neighbor classification and evaluate these on two collections of viruses totaling over 10,000 viruses. We show that our proposed method performs better than, or as well as, other methods at every level of the phylogenetic hierarchy. The data and R code is available upon request.

Automatic alignment of pre- and post-interventional liver CT images for assessment of radiofrequency ablation

NASA Astrophysics Data System (ADS)

Rieder, Christian; Wirtz, Stefan; Strehlow, Jan; Zidowitz, Stephan; Bruners, Philipp; Isfort, Peter; Mahnken, Andreas H.; Peitgen, Heinz-Otto

2012-02-01

Image-guided radiofrequency ablation (RFA) is becoming a standard procedure for minimally invasive tumor treatment in clinical practice. To verify the treatment success of the therapy, reliable post-interventional assessment of the ablation zone (coagulation) is essential. Typically, pre- and post-interventional CT images have to be aligned to compare the shape, size, and position of tumor and coagulation zone. In this work, we present an automatic workflow for masking liver tissue, enabling a rigid registration algorithm to perform at least as accurate as experienced medical experts. To minimize the effect of global liver deformations, the registration is computed in a local region of interest around the pre-interventional lesion and post-interventional coagulation necrosis. A registration mask excluding lesions and neighboring organs is calculated to prevent the registration algorithm from matching both lesion shapes instead of the surrounding liver anatomy. As an initial registration step, the centers of gravity from both lesions are aligned automatically. The subsequent rigid registration method is based on the Local Cross Correlation (LCC) similarity measure and Newton-type optimization. To assess the accuracy of our method, 41 RFA cases are registered and compared with the manually aligned cases from four medical experts. Furthermore, the registration results are compared with ground truth transformations based on averaged anatomical landmark pairs. In the evaluation, we show that our method allows to automatic alignment of the data sets with equal accuracy as medical experts, but requiring significancy less time consumption and variability.

A systematic review of the angular values obtained by computerized photogrammetry in sagittal plane: a proposal for reference values.

PubMed

Krawczky, Bruna; Pacheco, Antonio G; Mainenti, Míriam R M

2014-05-01

Reference values for postural alignment in the coronal plane, as measured by computerized photogrammetry, have been established but not for the sagittal plane. The objective of this study is to propose reference values for angular measurements used for postural analysis in the sagittal plane for healthy adults. Electronic databases (PubMed, BVS, Cochrane, Scielo, and Science Direct) were searched using the following key words: evaluation, posture, photogrammetry, and software. Articles published between 2006 and 2012 that used the PAS/SAPO (postural assessment software) were selected. Another inclusion criterion was the presentation of, at least, one of the following measurements: head horizontal alignment, pelvic horizontal alignment, hip angle, vertical alignment of the body, thoracic kyphosis, and lumbar lordosis. Angle samples of the selected articles were grouped 2 by 2 in relation to an overall average, which made possible total average, variance, and SD calculations. Six articles were included, and the following average angular values were found: 51.42° ± 4.87° (head horizontal alignment), -12.26° ± 5.81° (pelvic horizontal alignment), -6.40° ± 3.86° (hip angle), and 1.73° ± 0.94° (vertical alignment of the body). None of the articles contained the measurements for thoracic kyphosis and lumbar lordosis. The reference values can be adopted as reference for postural assessment in future researches if the same anatomical points are considered. Copyright © 2014 National University of Health Sciences. Published by Mosby, Inc. All rights reserved.

High Latitude Precipitating Energy Flux and Joule Heating During Geomagnetic Storms Determined from AMPERE Field-aligned Currents

NASA Astrophysics Data System (ADS)

Robinson, R. M.; Zanetti, L. J.; Anderson, B. J.; Korth, H.; Samara, M.; Michell, R.; Grubbs, G. A., II; Hampton, D. L.; Dropulic, A.

2016-12-01

A high latitude conductivity model based on field-aligned currents measured by the Active Magnetosphere and Planetary Electrodynamics Response Experiment (AMPERE) provides the means for complete specification of electric fields and currents at high latitudes. Based on coordinated measurements made by AMPERE and the Poker Flat Incoherent Scatter Radar, the model determines the most likely value of the ionospheric conductance from the direction, magnitude, and magnetic local time of the field-aligned current. A conductance model driven by field-aligned currents ensures spatial and temporal consistency between the calculated electrodynamic parameters. To validate the results, the Pedersen and Hall conductances were used to calculate the energy flux associated with the energetic particle precipitation. When integrated over the entire hemisphere, the total energy flux compares well with the Hemispheric Power Index derived from the OVATION-PRIME model. The conductances were also combined with the field-aligned currents to calculate the self-consistent electric field, which was then used to compute horizontal currents and Joule heating. The magnetic perturbations derived from the currents replicate most of the variations observed in ground-based magnetograms. The model was used to study high latitude particle precipitation, currents, and Joule heating for 24 magnetic storms. In most cases, the total energy input from precipitating particles and Joule heating exhibits a sharply-peaked maximum at the times of local minima in Dst, suggesting a close coupling between the ring current and the high latitude currents driven by the Region 2 field-aligned currents. The rapid increase and decrease of the high latitude energy deposition suggests an explosive transfer of energy from the magnetosphere to the ionosphere just prior to storm recovery.

Face landmark point tracking using LK pyramid optical flow

NASA Astrophysics Data System (ADS)

Zhang, Gang; Tang, Sikan; Li, Jiaquan

2018-04-01

LK pyramid optical flow is an effective method to implement object tracking in a video. It is used for face landmark point tracking in a video in the paper. The landmark points, i.e. outer corner of left eye, inner corner of left eye, inner corner of right eye, outer corner of right eye, tip of a nose, left corner of mouth, right corner of mouth, are considered. It is in the first frame that the landmark points are marked by hand. For subsequent frames, performance of tracking is analyzed. Two kinds of conditions are considered, i.e. single factors such as normalized case, pose variation and slowly moving, expression variation, illumination variation, occlusion, front face and rapidly moving, pose face and rapidly moving, and combination of the factors such as pose and illumination variation, pose and expression variation, pose variation and occlusion, illumination and expression variation, expression variation and occlusion. Global measures and local ones are introduced to evaluate performance of tracking under different factors or combination of the factors. The global measures contain the number of images aligned successfully, average alignment error, the number of images aligned before failure, and the local ones contain the number of images aligned successfully for components of a face, average alignment error for the components. To testify performance of tracking for face landmark points under different cases, tests are carried out for image sequences gathered by us. Results show that the LK pyramid optical flow method can implement face landmark point tracking under normalized case, expression variation, illumination variation which does not affect facial details, pose variation, and that different factors or combination of the factors have different effect on performance of alignment for different landmark points.

Equatorial Ionospheric Disturbance Field-Aligned Plasma Drifts Observed by C/NOFS

NASA Astrophysics Data System (ADS)

Zhang, Ruilong; Liu, Libo; Balan, N.; Le, Huijun; Chen, Yiding; Zhao, Biqiang

2018-05-01

Using C/NOFS satellite observations, this paper studies the disturbance field-aligned plasma drifts in the equatorial topside ionosphere during eight geomagnetic storms in 2011-2015. During all six storms occurred in the solstices, the disturbance field-aligned plasma drift is from winter to summer hemisphere especially in the morning-midnight local time sector and the disturbance is stronger in June solstice. The two storms occurred at equinoxes have very little effect on the field-aligned plasma drift. Using the plasma temperature data from DMSP satellites and Global Positioning System-total electron content, it is suggested that the plasma density gradient seems likely to cause the disturbance winter-to-summer plasma drift while the role of plasma temperature gradient is opposite to the observed plasma drift.

Spontaneous flow in polar active fluids: the effect of a phenomenological self propulsion-like term.

PubMed

Bonelli, Francesco; Gonnella, Giuseppe; Tiribocchi, Adriano; Marenduzzo, Davide

2016-01-01

We present hybrid lattice Boltzmann simulations of extensile and contractile active fluids where we incorporate phenomenologically the tendency of active particles such as cell and bacteria, to move, or swim, along the local orientation. Quite surprisingly, we show that the interplay between alignment and activity can lead to completely different results, according to geometry (periodic boundary conditions or confinement between flat walls) and nature of the activity (extensile or contractile). An interesting generic outcome is that the alignment interaction can transform stationary active patterns into continuously moving ones: the dynamics of these evolving patterns can be oscillatory or chaotic according to the strength of the alignment term. Our results suggest that flow-polarisation alignment can have important consequences on the collective dynamics of active fluids and active gel.

Patient Safety Incident Reporting: Current Trends and Gaps Within the Canadian Health System.

PubMed

Boucaud, Sarah; Dorschner, Danielle

2016-01-01

Patient safety incidents are a national-level phenomenon, requiring a pan-Canadian approach to ensure that incidents are reported and lessons are learned and broadly disseminated. This work explores the variation in current provincial and local approaches to reporting through a literature review. Trends are consolidated and recommendations are offered to foster better alignment of existing systems. These include adopting a common terminology, defining the patient role in reporting, increasing system users' perception of safety and further investigating the areas of home and community care in ensuring standard approaches at the local level. These steps can promote alignment, reducing barriers to a future pan-Canadian reporting and learning system.

Robust video copy detection approach based on local tangent space alignment

NASA Astrophysics Data System (ADS)

Nie, Xiushan; Qiao, Qianping

2012-04-01

We propose a robust content-based video copy detection approach based on local tangent space alignment (LTSA), which is an efficient dimensionality reduction algorithm. The idea is motivated by the fact that the content of video becomes richer and the dimension of content becomes higher. It does not give natural tools for video analysis and understanding because of the high dimensionality. The proposed approach reduces the dimensionality of video content using LTSA, and then generates video fingerprints in low dimensional space for video copy detection. Furthermore, a dynamic sliding window is applied to fingerprint matching. Experimental results show that the video copy detection approach has good robustness and discrimination.

Visual Search in ASD: Instructed versus Spontaneous Local and Global Processing

ERIC Educational Resources Information Center

Van der Hallen, Ruth; Evers, Kris; Boets, Bart; Steyaert, Jean; Noens, Ilse; Wagemans, Johan

2016-01-01

Visual search has been used extensively to investigate differences in mid-level visual processing between individuals with ASD and TD individuals. The current study employed two visual search paradigms with Gaborized stimuli to assess the impact of task distractors (Experiment 1) and task instruction (Experiment 2) on local-global visual…

The Exercise: An Exercise Generator Tool for the SOURCe Project

ERIC Educational Resources Information Center

Kakoyianni-Doa, Fryni; Tziafa, Eleni; Naskos, Athanasios

2016-01-01

The Exercise, an Exercise generator in the SOURCe project, is a tool that complements the properties and functionalities of the SOURCe project, which includes the search engine for the Searchable Online French-Greek parallel corpus for the UniveRsity of Cyprus (SOURCe) (Kakoyianni-Doa & Tziafa, 2013), the PENCIL (an alignment tool)…

SU-E-T-366: Clinical Implementation of MR-Guided Vaginal Cylinder Brachytherapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Owrangi, A; Jolly, S; Balter, J

2014-06-01

Purpose: To evaluate the accuracy of MR-based vaginal brachytherapy source localization using an in-house MR-visible marker versus the alignment of an applicator model to MR images. Methods: Three consecutive patients undergoing vaginal HDR brachytherapy with a plastic cylinder were scanned with both CT and MRI (including T1- and T2- weighted images). An MR-visible source localization marker, consisting of a sealed thin catheter filled with either water (for T2 contrast) or Gd-doped water (for T1 contrast), was assembled shortly before scanning. Clinically, the applicator channel was digitized on CT with an x-ray marker. To evaluate the efficacy of MR-based applicator reconstruction,more » each MR image volume was aligned locally to the CT images based on the region containing the cylinder. Applicator digitization was performed on the MR images using (1) the MR visible marker and (2) alignment of an applicator surface model from Varian's Brachytherapy Planning software to the MRI images. Resulting source positions were compared with the original CT digitization. Results: Although the source path was visualized by the MR marker, the applicator tip proved difficult to identify due to challenges in achieving a watertight seal. This resulted in observed displacements of the catheter tip, at times >1cm. Deviations between the central source positions identified via aligning the applicator surface model to MR and using the xray marker on CT ranged from 0.07 – 0.19 cm and 0.07 – 0.20 cm on T1- weighted and T2-weighted images, respectively. Conclusion: Based on the current study, aligning the applicator model to MRI provides a practical, current approach to perform MR-based brachytherapy planning. Further study is needed to produce catheters with reliably and reproducibly identifiable tips. Attempts are being made to improve catheter seals, as well as to increase the viscosity of the contrast material to decrease fluid mobility inside the catheter.« less

Pathway Tools version 19.0 update: software for pathway/genome informatics and systems biology

PubMed Central

Latendresse, Mario; Paley, Suzanne M.; Krummenacker, Markus; Ong, Quang D.; Billington, Richard; Kothari, Anamika; Weaver, Daniel; Lee, Thomas; Subhraveti, Pallavi; Spaulding, Aaron; Fulcher, Carol; Keseler, Ingrid M.; Caspi, Ron

2016-01-01

Pathway Tools is a bioinformatics software environment with a broad set of capabilities. The software provides genome-informatics tools such as a genome browser, sequence alignments, a genome-variant analyzer and comparative-genomics operations. It offers metabolic-informatics tools, such as metabolic reconstruction, quantitative metabolic modeling, prediction of reaction atom mappings and metabolic route search. Pathway Tools also provides regulatory-informatics tools, such as the ability to represent and visualize a wide range of regulatory interactions. This article outlines the advances in Pathway Tools in the past 5 years. Major additions include components for metabolic modeling, metabolic route search, computation of atom mappings and estimation of compound Gibbs free energies of formation; addition of editors for signaling pathways, for genome sequences and for cellular architecture; storage of gene essentiality data and phenotype data; display of multiple alignments, and of signaling and electron-transport pathways; and development of Python and web-services application programming interfaces. Scientists around the world have created more than 9800 Pathway/Genome Databases by using Pathway Tools, many of which are curated databases for important model organisms. PMID:26454094

Mi-DISCOVERER: A bioinformatics tool for the detection of mi-RNA in human genome.

PubMed

Arshad, Saadia; Mumtaz, Asia; Ahmad, Freed; Liaquat, Sadia; Nadeem, Shahid; Mehboob, Shahid; Afzal, Muhammad

2010-11-27

MicroRNAs (miRNAs) are 22 nucleotides non-coding RNAs that play pivotal regulatory roles in diverse organisms including the humans and are difficult to be identified due to lack of either sequence features or robust algorithms to efficiently identify. Therefore, we made a tool that is Mi-Discoverer for the detection of miRNAs in human genome. The tools used for the development of software are Microsoft Office Access 2003, the JDK version 1.6.0, BioJava version 1.0, and the NetBeans IDE version 6.0. All already made miRNAs softwares were web based; so the advantage of our project was to make a desktop facility to the user for sequence alignment search with already identified miRNAs of human genome present in the database. The user can also insert and update the newly discovered human miRNA in the database. Mi-Discoverer, a bioinformatics tool successfully identifies human miRNAs based on multiple sequence alignment searches. It's a non redundant database containing a large collection of publicly available human miRNAs.

Mi-DISCOVERER: A bioinformatics tool for the detection of mi-RNA in human genome

PubMed Central

Arshad, Saadia; Mumtaz, Asia; Ahmad, Freed; Liaquat, Sadia; Nadeem, Shahid; Mehboob, Shahid; Afzal, Muhammad

2010-01-01

MicroRNAs (miRNAs) are 22 nucleotides non-coding RNAs that play pivotal regulatory roles in diverse organisms including the humans and are difficult to be identified due to lack of either sequence features or robust algorithms to efficiently identify. Therefore, we made a tool that is Mi-Discoverer for the detection of miRNAs in human genome. The tools used for the development of software are Microsoft Office Access 2003, the JDK version 1.6.0, BioJava version 1.0, and the NetBeans IDE version 6.0. All already made miRNAs softwares were web based; so the advantage of our project was to make a desktop facility to the user for sequence alignment search with already identified miRNAs of human genome present in the database. The user can also insert and update the newly discovered human miRNA in the database. Mi-Discoverer, a bioinformatics tool successfully identifies human miRNAs based on multiple sequence alignment searches. It's a non redundant database containing a large collection of publicly available human miRNAs. PMID:21364831

Enhanced optical alignment of a digital micro mirror device through Bayesian adaptive exploration

NASA Astrophysics Data System (ADS)

Wynne, Kevin B.; Knuth, Kevin H.; Petruccelli, Jonathan

2017-12-01

As the use of Digital Micro Mirror Devices (DMDs) becomes more prevalent in optics research, the ability to precisely locate the Fourier "footprint" of an image beam at the Fourier plane becomes a pressing need. In this approach, Bayesian adaptive exploration techniques were employed to characterize the size and position of the beam on a DMD located at the Fourier plane. It couples a Bayesian inference engine with an inquiry engine to implement the search. The inquiry engine explores the DMD by engaging mirrors and recording light intensity values based on the maximization of the expected information gain. Using the data collected from this exploration, the Bayesian inference engine updates the posterior probability describing the beam's characteristics. The process is iterated until the beam is located to within the desired precision. This methodology not only locates the center and radius of the beam with remarkable precision but accomplishes the task in far less time than a brute force search. The employed approach has applications to system alignment for both Fourier processing and coded aperture design.

G-Anchor: a novel approach for whole-genome comparative mapping utilizing evolutionary conserved DNA sequences.

PubMed

Lenis, Vasileios Panagiotis E; Swain, Martin; Larkin, Denis M

2018-05-01

Cross-species whole-genome sequence alignment is a critical first step for genome comparative analyses, ranging from the detection of sequence variants to studies of chromosome evolution. Animal genomes are large and complex, and whole-genome alignment is a computationally intense process, requiring expensive high-performance computing systems due to the need to explore extensive local alignments. With hundreds of sequenced animal genomes available from multiple projects, there is an increasing demand for genome comparative analyses. Here, we introduce G-Anchor, a new, fast, and efficient pipeline that uses a strictly limited but highly effective set of local sequence alignments to anchor (or map) an animal genome to another species' reference genome. G-Anchor makes novel use of a databank of highly conserved DNA sequence elements. We demonstrate how these elements may be aligned to a pair of genomes, creating anchors. These anchors enable the rapid mapping of scaffolds from a de novo assembled genome to chromosome assemblies of a reference species. Our results demonstrate that G-Anchor can successfully anchor a vertebrate genome onto a phylogenetically related reference species genome using a desktop or laptop computer within a few hours and with comparable accuracy to that achieved by a highly accurate whole-genome alignment tool such as LASTZ. G-Anchor thus makes whole-genome comparisons accessible to researchers with limited computational resources. G-Anchor is a ready-to-use tool for anchoring a pair of vertebrate genomes. It may be used with large genomes that contain a significant fraction of evolutionally conserved DNA sequences and that are not highly repetitive, polypoid, or excessively fragmented. G-Anchor is not a substitute for whole-genome aligning software but can be used for fast and accurate initial genome comparisons. G-Anchor is freely available and a ready-to-use tool for the pairwise comparison of two genomes.

Sparse alignment for robust tensor learning.

PubMed

Lai, Zhihui; Wong, Wai Keung; Xu, Yong; Zhao, Cairong; Sun, Mingming

2014-10-01

Multilinear/tensor extensions of manifold learning based algorithms have been widely used in computer vision and pattern recognition. This paper first provides a systematic analysis of the multilinear extensions for the most popular methods by using alignment techniques, thereby obtaining a general tensor alignment framework. From this framework, it is easy to show that the manifold learning based tensor learning methods are intrinsically different from the alignment techniques. Based on the alignment framework, a robust tensor learning method called sparse tensor alignment (STA) is then proposed for unsupervised tensor feature extraction. Different from the existing tensor learning methods, L1- and L2-norms are introduced to enhance the robustness in the alignment step of the STA. The advantage of the proposed technique is that the difficulty in selecting the size of the local neighborhood can be avoided in the manifold learning based tensor feature extraction algorithms. Although STA is an unsupervised learning method, the sparsity encodes the discriminative information in the alignment step and provides the robustness of STA. Extensive experiments on the well-known image databases as well as action and hand gesture databases by encoding object images as tensors demonstrate that the proposed STA algorithm gives the most competitive performance when compared with the tensor-based unsupervised learning methods.

Evaluation of Eight Methods for Aligning Orientation of Two Coordinate Systems.

PubMed

Mecheri, Hakim; Robert-Lachaine, Xavier; Larue, Christian; Plamondon, André

2016-08-01

The aim of this study was to evaluate eight methods for aligning the orientation of two different local coordinate systems. Alignment is very important when combining two different systems of motion analysis. Two of the methods were developed specifically for biomechanical studies, and because there have been at least three decades of algorithm development in robotics, it was decided to include six methods from this field. To compare these methods, an Xsens sensor and two Optotrak clusters were attached to a Plexiglas plate. The first optical marker cluster was fixed on the sensor and 20 trials were recorded. The error of alignment was calculated for each trial, and the mean, the standard deviation, and the maximum values of this error over all trials were reported. One-way repeated measures analysis of variance revealed that the alignment error differed significantly across the eight methods. Post-hoc tests showed that the alignment error from the methods based on angular velocities was significantly lower than for the other methods. The method using angular velocities performed the best, with an average error of 0.17 ± 0.08 deg. We therefore recommend this method, which is easy to perform and provides accurate alignment.

Direct numerical simulation of particle alignment in viscoelastic fluids

NASA Astrophysics Data System (ADS)

Hulsen, Martien; Jaensson, Nick; Anderson, Patrick

2016-11-01

Rigid particles suspended in viscoelastic fluids under shear can align in string-like structures in flow direction. To unravel this phenomenon, we present 3D direct numerical simulations of the alignment of two and three rigid, non-Brownian particles in a shear flow of a viscoelastic fluid. The equations are solved on moving, boundary-fitted meshes, which are locally refined to accurately describe the polymer stresses around and in between the particles. A small minimal gap size between the particles is introduced. The Giesekus model is used and the effect of the Weissenberg number, shear thinning and solvent viscosity is investigated. Alignment of two and three particles is observed. Morphology plots have been created for various combinations of fluid parameters. Alignment is mainly governed by the value of the elasticity parameter S, defined as half of the ratio between the first normal stress difference and shear stress of the suspending fluid. Alignment appears to occur above a critical value of S, which decreases with increasing shear thinning. This result, together with simulations of a shear-thinning Carreau fluid, leads us to the conclusion that normal stress differences are essential for particle alignment to occur, but it is also strongly promoted by shear thinning.

Global Alignment of Pairwise Protein Interaction Networks for Maximal Common Conserved Patterns

DOE PAGES

Tian, Wenhong; Samatova, Nagiza F.

2013-01-01

A number of tools for the alignment of protein-protein interaction (PPI) networks have laid the foundation for PPI network analysis. Most of alignment tools focus on finding conserved interaction regions across the PPI networks through either local or global mapping of similar sequences. Researchers are still trying to improve the speed, scalability, and accuracy of network alignment. In view of this, we introduce a connected-components based fast algorithm, HopeMap, for network alignment. Observing that the size of true orthologs across species is small comparing to the total number of proteins in all species, we take a different approach based onmore » a precompiled list of homologs identified by KO terms. Applying this approach to S. cerevisiae (yeast) and D. melanogaster (fly), E. coli K12 and S. typhimurium , E. coli K12 and C. crescenttus , we analyze all clusters identified in the alignment. The results are evaluated through up-to-date known gene annotations, gene ontology (GO), and KEGG ortholog groups (KO). Comparing to existing tools, our approach is fast with linear computational cost, highly accurate in terms of KO and GO terms specificity and sensitivity, and can be extended to multiple alignments easily.« less

Quantification of Cardiomyocyte Alignment from Three-Dimensional (3D) Confocal Microscopy of Engineered Tissue.

PubMed

Kowalski, William J; Yuan, Fangping; Nakane, Takeichiro; Masumoto, Hidetoshi; Dwenger, Marc; Ye, Fei; Tinney, Joseph P; Keller, Bradley B

2017-08-01

Biological tissues have complex, three-dimensional (3D) organizations of cells and matrix factors that provide the architecture necessary to meet morphogenic and functional demands. Disordered cell alignment is associated with congenital heart disease, cardiomyopathy, and neurodegenerative diseases and repairing or replacing these tissues using engineered constructs may improve regenerative capacity. However, optimizing cell alignment within engineered tissues requires quantitative 3D data on cell orientations and both efficient and validated processing algorithms. We developed an automated method to measure local 3D orientations based on structure tensor analysis and incorporated an adaptive subregion size to account for multiple scales. Our method calculates the statistical concentration parameter, κ, to quantify alignment, as well as the traditional orientational order parameter. We validated our method using synthetic images and accurately measured principal axis and concentration. We then applied our method to confocal stacks of cleared, whole-mount engineered cardiac tissues generated from human-induced pluripotent stem cells or embryonic chick cardiac cells and quantified cardiomyocyte alignment. We found significant differences in alignment based on cellular composition and tissue geometry. These results from our synthetic images and confocal data demonstrate the efficiency and accuracy of our method to measure alignment in 3D tissues.

Automated and Adaptable Quantification of Cellular Alignment from Microscopic Images for Tissue Engineering Applications

PubMed Central

Xu, Feng; Beyazoglu, Turker; Hefner, Evan; Gurkan, Umut Atakan

2011-01-01

Cellular alignment plays a critical role in functional, physical, and biological characteristics of many tissue types, such as muscle, tendon, nerve, and cornea. Current efforts toward regeneration of these tissues include replicating the cellular microenvironment by developing biomaterials that facilitate cellular alignment. To assess the functional effectiveness of the engineered microenvironments, one essential criterion is quantification of cellular alignment. Therefore, there is a need for rapid, accurate, and adaptable methodologies to quantify cellular alignment for tissue engineering applications. To address this need, we developed an automated method, binarization-based extraction of alignment score (BEAS), to determine cell orientation distribution in a wide variety of microscopic images. This method combines a sequenced application of median and band-pass filters, locally adaptive thresholding approaches and image processing techniques. Cellular alignment score is obtained by applying a robust scoring algorithm to the orientation distribution. We validated the BEAS method by comparing the results with the existing approaches reported in literature (i.e., manual, radial fast Fourier transform-radial sum, and gradient based approaches). Validation results indicated that the BEAS method resulted in statistically comparable alignment scores with the manual method (coefficient of determination R2=0.92). Therefore, the BEAS method introduced in this study could enable accurate, convenient, and adaptable evaluation of engineered tissue constructs and biomaterials in terms of cellular alignment and organization. PMID:21370940

Evaluation of peak picking quality in LC-MS metabolomics data.

PubMed

Brodsky, Leonid; Moussaieff, Arieh; Shahaf, Nir; Aharoni, Asaph; Rogachev, Ilana

2010-11-15

The output of LC-MS metabolomics experiments consists of mass-peak intensities identified through a peak-picking/alignment procedure. Besides imperfections in biological samples and instrumentation, data accuracy is highly dependent on the applied algorithms and their parameters. Consequently, quality control (QC) is essential for further data analysis. Here, we present a QC approach that is based on discrepancies between replicate samples. First, the quantile normalization of per-sample log-signal distributions is applied to each group of biologically homogeneous samples. Next, the overall quality of each replicate group is characterized by the Z-transformed correlation coefficients between samples. This general QC allows a tuning of the procedure's parameters which minimizes the inter-replicate discrepancies in the generated output. Subsequently, an in-depth QC measure detects local neighborhoods on a template of aligned chromatograms that are enriched by divergences between intensity profiles of replicate samples. These neighborhoods are determined through a segmentation algorithm. The retention time (RT)-m/z positions of the neighborhoods with local divergences are indicative of either: incorrect alignment of chromatographic features, technical problems in the chromatograms, or to a true biological discrepancy between replicates for particular metabolites. We expect this method to aid in the accurate analysis of metabolomics data and in the development of new peak-picking/alignment procedures.

Frontiers of controlling energy levels at interfaces

NASA Astrophysics Data System (ADS)

Koch, Norbert

The alignment of electron energy levels at interfaces between semiconductors, dielectrics, and electrodes determines the function and efficiency of all electronic and optoelectronic devices. Reliable guidelines for predicting the level alignment for a given material combination and methods to adjust the intrinsic energy landscape are needed to enable efficient engineering approaches. These are sufficiently understood for established electronic materials, e.g., Si, but for the increasing number of emerging materials, e.g., organic and 2D semiconductors, perovskites, this is work in progress. The intrinsic level alignment and the underlying mechanisms at interfaces between organic and inorganic semiconductors are discussed first. Next, methods to alter the level alignment are introduced, which all base on proper charge density rearrangement at a heterojunction. As interface modification agents we use molecular electron acceptors and donors, as well as molecular photochromic switches that add a dynamic aspect and allow device multifunctionality. For 2D semiconductors surface transfer doping with molecular acceptors/donors transpires as viable method to locally tune the Fermi-level position in the energy gap. The fundamental electronic properties of a prototypical 1D interface between intrinsic and p-doped 2D semiconductor regions are derived from local (scanning probe) and area-averaged (photoemission) spectroscopy experiments. Future research opportunities for attaining unsurpassed interface control through charge density management are discussed.

Misaligned Image Integration With Local Linear Model.

PubMed

Baba, Tatsuya; Matsuoka, Ryo; Shirai, Keiichiro; Okuda, Masahiro

2016-05-01

We present a new image integration technique for a flash and long-exposure image pair to capture a dark scene without incurring blurring or noisy artifacts. Most existing methods require well-aligned images for the integration, which is often a burdensome restriction in practical use. We address this issue by locally transferring the colors of the flash images using a small fraction of the corresponding pixels in the long-exposure images. We formulate the image integration as a convex optimization problem with the local linear model. The proposed method makes it possible to integrate the color of the long-exposure image with the detail of the flash image without causing any harmful effects to its contrast, where we do not need perfect alignment between the images by virtue of our new integration principle. We show that our method successfully outperforms the state of the art in the image integration and reference-based color transfer for challenging misaligned data sets.

Orientation of cosmic web filaments with respect to the underlying velocity field

NASA Astrophysics Data System (ADS)

Tempel, E.; Libeskind, N. I.; Hoffman, Y.; Liivamägi, L. J.; Tamm, A.

2014-01-01

The large-scale structure of the Universe is characterized by a web-like structure made of voids, sheets, filaments and knots. The structure of this so-called cosmic web is dictated by the local velocity shear tensor. In particular, the local direction of a filament should be strongly aligned with hat{e}_3, the eigenvector associated with the smallest eigenvalue of the tensor. That conjecture is tested here on the basis of a cosmological simulation. The cosmic web delineated by the halo distribution is probed by a marked point process with interactions (the Bisous model), detecting filaments directly from the halo distribution (P-web). The detected P-web filaments are found to be strongly aligned with the local hat{e}_3: the alignment is within 30° for ˜80 per cent of the elements. This indicates that large-scale filaments defined purely from the distribution of haloes carry more than just morphological information, although the Bisous model does not make any prior assumption on the underlying shear tensor. The P-web filaments are also compared to the structure revealed from the velocity shear tensor itself (V-web). In the densest regions, the P- and V-web filaments overlap well (90 per cent), whereas in lower density regions, the P-web filaments preferentially mark sheets in the V-web.

Stable azodye photo-alignment layer for liquid crystal devices achieved by "turning off" dye photosensitivity

NASA Astrophysics Data System (ADS)

McGinty, C.; Finnemeyer, V.; Reich, R.; Clark, H.; Berry, S.; Bos, P.

2017-11-01

We have previously proposed a low cost, versatile process for stabilizing azodye photo-alignment layers for liquid crystal devices by utilizing a surface localized reactive mesogen (RM) layer. The RM is applied by dissolving the monomer in a liquid crystal material prior to filling the cell. In this paper, we show the significant effect of azodye layer thickness on the long term stability of these alignment layers when exposed to polarized light. We demonstrate, surprisingly, that thin azodye layers (˜3 nm) provide improved stability over thicker (˜40 nm) layers. Using this process, we show cells which have been stable to exposure with polarized light through one month. Additionally, we demonstrate the use of a photo-alignment layer to align the liquid crystals that afterwards can be rendered insensitive to polarized light. This was accomplished by using the process described above with the additional step of eliminating the photosensitivity of the azodye layer through photo-bleaching; the result is an RM alignment layer that will be stable when exposed to polarized light in the dye absorption band.

Evolutionary-inspired probabilistic search for enhancing sampling of local minima in the protein energy surface

PubMed Central

2012-01-01

Background Despite computational challenges, elucidating conformations that a protein system assumes under physiologic conditions for the purpose of biological activity is a central problem in computational structural biology. While these conformations are associated with low energies in the energy surface that underlies the protein conformational space, few existing conformational search algorithms focus on explicitly sampling low-energy local minima in the protein energy surface. Methods This work proposes a novel probabilistic search framework, PLOW, that explicitly samples low-energy local minima in the protein energy surface. The framework combines algorithmic ingredients from evolutionary computation and computational structural biology to effectively explore the subspace of local minima. A greedy local search maps a conformation sampled in conformational space to a nearby local minimum. A perturbation move jumps out of a local minimum to obtain a new starting conformation for the greedy local search. The process repeats in an iterative fashion, resulting in a trajectory-based exploration of the subspace of local minima. Results and conclusions The analysis of PLOW's performance shows that, by navigating only the subspace of local minima, PLOW is able to sample conformations near a protein's native structure, either more effectively or as well as state-of-the-art methods that focus on reproducing the native structure for a protein system. Analysis of the actual subspace of local minima shows that PLOW samples this subspace more effectively that a naive sampling approach. Additional theoretical analysis reveals that the perturbation function employed by PLOW is key to its ability to sample a diverse set of low-energy conformations. This analysis also suggests directions for further research and novel applications for the proposed framework. PMID:22759582

The Generation of the Distant Kuiper Belt by Planet Nine from an Initially Broad Perihelion Distribution

NASA Astrophysics Data System (ADS)

Khain, Tali; Batygin, Konstantin; Brown, Michael E.

2018-04-01

The observation that the orbits of long-period Kuiper Belt objects are anomalously clustered in physical space has recently prompted the Planet Nine hypothesis - the proposed existence of a distant and eccentric planetary member of our Solar System. Within the framework of this model, a Neptune-like perturber sculpts the orbital distribution of distant Kuiper Belt objects through a complex interplay of resonant and secular effects, such that the surviving orbits get organized into apsidally aligned and anti-aligned configurations with respect to Planet Nine's orbit. We present results on the role of Kuiper Belt initial conditions on the evolution of the outer Solar System using numerical simulations. Intriguingly, we find that the final perihelion distance distribution depends strongly on the primordial state of the system, and demonstrate that a bimodal structure corresponding to the existence of both aligned and anti-aligned clusters is only reproduced if the initial perihelion distribution is assumed to extend well beyond 36 AU. The bimodality in the final perihelion distance distribution is due to the permanently stable objects, with the lower perihelion peak corresponding to the anti-aligned orbits and the higher perihelion peak corresponding to the aligned orbits. We identify the mechanisms that enable the persistent stability of these objects and locate the regions of phase space in which they reside. The obtained results contextualize the Planet Nine hypothesis within the broader narrative of solar system formation, and offer further insight into the observational search for Planet Nine.

A hierarchical transition state search algorithm

NASA Astrophysics Data System (ADS)

del Campo, Jorge M.; Köster, Andreas M.

2008-07-01

A hierarchical transition state search algorithm is developed and its implementation in the density functional theory program deMon2k is described. This search algorithm combines the double ended saddle interpolation method with local uphill trust region optimization. A new formalism for the incorporation of the distance constrain in the saddle interpolation method is derived. The similarities between the constrained optimizations in the local trust region method and the saddle interpolation are highlighted. The saddle interpolation and local uphill trust region optimizations are validated on a test set of 28 representative reactions. The hierarchical transition state search algorithm is applied to an intramolecular Diels-Alder reaction with several internal rotors, which makes automatic transition state search rather challenging. The obtained reaction mechanism is discussed in the context of the experimentally observed product distribution.

Impact of materials engineering on edge placement error (Conference Presentation)

NASA Astrophysics Data System (ADS)

Freed, Regina; Mitra, Uday; Zhang, Ying

2017-04-01

Transistor scaling has transitioned from wavelength scaling to multi-patterning techniques, due to the resolution limits of immersion of immersion lithography. Deposition and etch have enabled scaling in the by means of SADP and SAQP. Spacer based patterning enables extremely small linewidths, sufficient for several future generations of transistors. However, aligning layers in Z-direction, as well as aligning cut and via patterning layers, is becoming a road-block due to global and local feature variation and fidelity. This presentation will highlight the impact of deposition and etch on this feature alignment (EPE) and illustrate potential paths toward lowering EPE using material engineering.

A Wandering Mind Does Not Stray Far from Home: The Value of Metacognition in Distant Search

PubMed Central

Kudesia, Ravi S.; Baer, Markus; Elfenbein, Hillary Anger

2015-01-01

When faced with a problem, how do individuals search for potential solutions? In this article, we explore the cognitive processes that lead to local search (i.e., identifying options closest to existing solutions) and distant search (i.e., identifying options of a qualitatively different nature than existing solutions). We suggest that mind wandering is likely to lead to local search because it operates by spreading activation from initial ideas to closely associated ideas. This reduces the likelihood of accessing a qualitatively different solution. However, instead of getting lost in thought, individuals can also step back and monitor their thoughts from a detached perspective. Such mindful metacognition, we suggest, is likely to lead to distant search because it redistributes activation away from initial ideas to other, less strongly associated, ideas. This hypothesis was confirmed across two studies. Thus, getting lost in thoughts is helpful when one is on the right track and needs only a local search whereas stepping back from thoughts is helpful when one needs distant search to produce a change in perspective. PMID:25974164

Algorithms for Automatic Alignment of Arrays

NASA Technical Reports Server (NTRS)

Chatterjee, Siddhartha; Gilbert, John R.; Oliker, Leonid; Schreiber, Robert; Sheffler, Thomas J.

1996-01-01

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

3-D Localization Method for a Magnetically Actuated Soft Capsule Endoscope and Its Applications

PubMed Central

Yim, Sehyuk; Sitti, Metin

2014-01-01

In this paper, we present a 3-D localization method for a magnetically actuated soft capsule endoscope (MASCE). The proposed localization scheme consists of three steps. First, MASCE is oriented to be coaxially aligned with an external permanent magnet (EPM). Second, MASCE is axially contracted by the enhanced magnetic attraction of the approaching EPM. Third, MASCE recovers its initial shape by the retracting EPM as the magnetic attraction weakens. The combination of the estimated direction in the coaxial alignment step and the estimated distance in the shape deformation (recovery) step provides the position of MASCE in 3-D. It is experimentally shown that the proposed localization method could provide 2.0–3.7 mm of distance error in 3-D. This study also introduces two new applications of the proposed localization method. First, based on the trace of contact points between the MASCE and the surface of the stomach, the 3-D geometrical model of a synthetic stomach was reconstructed. Next, the relative tissue compliance at each local contact point in the stomach was characterized by measuring the local tissue deformation at each point due to the preloading force. Finally, the characterized relative tissue compliance parameter was mapped onto the geometrical model of the stomach toward future use in disease diagnosis. PMID:25383064

Gentle Masking of Low-Complexity Sequences Improves Homology Search

PubMed Central

Frith, Martin C.

2011-01-01

Detection of sequences that are homologous, i.e. descended from a common ancestor, is a fundamental task in computational biology. This task is confounded by low-complexity tracts (such as atatatatatat), which arise frequently and independently, causing strong similarities that are not homologies. There has been much research on identifying low-complexity tracts, but little research on how to treat them during homology search. We propose to find homologies by aligning sequences with “gentle” masking of low-complexity tracts. Gentle masking means that the match score involving a masked letter is , where is the unmasked score. Gentle masking slightly but noticeably improves the sensitivity of homology search (compared to “harsh” masking), without harming specificity. We show examples in three useful homology search problems: detection of NUMTs (nuclear copies of mitochondrial DNA), recruitment of metagenomic DNA reads to reference genomes, and pseudogene detection. Gentle masking is currently the best way to treat low-complexity tracts during homology search. PMID:22205972

Culturally grounded indicators of resilience in social-ecological systems

Treesearch

Eleanor Sterling; Tamara Ticktin; Tē Kipa Kepa Morgan; Georgina Cullman; Diana Alvira; Pelika Andrade; Nadia Bergamini; Erin Betley; Kate Burrows; Sophie Caillon; Joachim Claudet; Rachel Dacks; Pablo Eyzaguirre; Chris Filardi; Nadav Gazit; Christian Giardina; Stacy Jupiter; Kealohanuiopuna Kinney; Joe McCarter; Manuel Mejia; Kanoe Morishige; Jennifer Newell; Lihla Noori; John Parks; Pua‘ala Pascua; Ashwin Ravikumar; Jamie Tanguay; Amanda Sigouin; Tina Stege; Mark Stege; Alaka Wali

2017-01-01

Measuring progress toward sustainability goals is a multifaceted task. International, regional, and national organizations and agencies seek to promote resilience and capacity for adaptation at local levels. However, their measurement systems may be poorly aligned with local contexts, cultures, and needs. Understanding how to build effective, culturally grounded...

Collective Motion in Behaviorally Heterogeneous Systems

NASA Astrophysics Data System (ADS)

Copenhagen, Katherine

Collective motion is a widespread phenomenon in nature where individuals actively propel themselves, gather together and move as a group. Some examples of collective motion are bird flocks, fish schools, bacteria swarms, cell clusters, and crowds of people. Many models seek to understand the effects of activity in collective systems including things such as environmental disorder, density, and interaction details primarily at infinite size limits and with uniform populations. In this dissertation I investigate the effects of finite sizes and behavioral heterogeneity as it exists in nature. Behavioral heterogeneity can originate from several different sources. Mixed populations of individuals can have inherently different behaviors such as mutant bacteria, injured fish, or agents that prefer individualistic behavior over coordinated motion. Alternatively, agents may modify their own behavior based on some local environmental dependency, such as local substrate, or density. In cases such as mutant cheaters in bacteria or malfunctioning drones in swarms, mixed populations of behaviorally heterogeneous agents can be modelled as arising in the form of aligning and non-aligning agents. When this kind of heterogeneity is introduced, there is a critical carrying capacity of non-aligners above which the system is unable to form a cohesive ordered group. However, if the cohesion of the group is relaxed to allow for fracture, the system will actively sort out non-aligning agents the system will exist at a critical non-aligner fraction. A similar heterogeneity could result in a mixture of high and low noise individuals. In this case there is also a critical carry capacity beyond which the system is unable to reach an ordered state, however the nature of this transition depends on the model details. Agents which are part of an ordered collective may vary their behavior as the group changes environments such as a flock of birds flying into a cloud. Using a unique model of a flock where the group behaves as a rigid disk reveals interesting behaviors as the system crosses a boundary between interfaces. The collective rotates and reorients or becomes stuck on the boundary as it crosses. I also investigate the effects of variable behavior depending on local density, and find that a frustration driven transient rotational phase arises in clusters where agents with low local density move faster than those with high local density as in cell clusters. All together I have shown that behavioral heterogeneity in collective motion can lead to unique phases and behaviors that are not seen in their homogeneous counterparts.

Power law-based local search in spider monkey optimisation for lower order system modelling

NASA Astrophysics Data System (ADS)

Sharma, Ajay; Sharma, Harish; Bhargava, Annapurna; Sharma, Nirmala

2017-01-01

The nature-inspired algorithms (NIAs) have shown efficiency to solve many complex real-world optimisation problems. The efficiency of NIAs is measured by their ability to find adequate results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This paper presents a solution for lower order system modelling using spider monkey optimisation (SMO) algorithm to obtain a better approximation for lower order systems and reflects almost original higher order system's characteristics. Further, a local search strategy, namely, power law-based local search is incorporated with SMO. The proposed strategy is named as power law-based local search in SMO (PLSMO). The efficiency, accuracy and reliability of the proposed algorithm is tested over 20 well-known benchmark functions. Then, the PLSMO algorithm is applied to solve the lower order system modelling problem.

On the alignment of cellulose microfibrils by cortical microtubules: a review and a model.

PubMed

Baskin, T I

2001-01-01

The hypothesis that microtubules align microfibrils, termed the alignment hypothesis, states that there is a causal link between the orientation of cortical microtubules and the orientation of nascent microfibrils. I have assessed the generality of this hypothesis by reviewing what is known about the relation between microtubules and microfibrils in a wide group of examples: in algae of the family Characeae, Closterium acerosum, Oocystis solitaria, and certain genera of green coenocytes and in land plant tip-growing cells, xylem, diffusely growing cells, and protoplasts. The salient features about microfibril alignment to emerge are as follows. Cellulose microfibrils can be aligned by cortical microtubules, thus supporting the alignment hypothesis. Alignment of microfibrils can occur independently of microtubules, showing that an alternative to the alignment hypothesis must exist. Microfibril organization is often random, suggesting that self-assembly is insufficient. Microfibril organization differs on different faces of the same cell, suggesting that microfibrils are aligned locally, not with respect to the entire cell. Nascent microfibrils appear to associate tightly with the plasma membrane. To account for these observations, I present a model that posits alignment to be mediated through binding the nascent microfibril. The model, termed templated incorporation, postulates that the nascent microfibril is incorporated into the cell wall by binding to a scaffold that is oriented; further, the scaffold is built and oriented around either already incorporated microfibrils or plasma membrane proteins, or both. The role of cortical microtubules is to bind and orient components of the scaffold at the plasma membrane. In this way, spatial information to align the microfibrils may come from either the cell wall or the cell interior, and microfibril alignment with and without microtubules are subsets of a single mechanism.

LCS-TA to identify similar fragments in RNA 3D structures.

PubMed

Wiedemann, Jakub; Zok, Tomasz; Milostan, Maciej; Szachniuk, Marta

2017-10-23

In modern structural bioinformatics, comparison of molecular structures aimed to identify and assess similarities and differences between them is one of the most commonly performed procedures. It gives the basis for evaluation of in silico predicted models. It constitutes the preliminary step in searching for structural motifs. In particular, it supports tracing the molecular evolution. Faced with an ever-increasing amount of available structural data, researchers need a range of methods enabling comparative analysis of the structures from either global or local perspective. Herein, we present a new, superposition-independent method which processes pairs of RNA 3D structures to identify their local similarities. The similarity is considered in the context of structure bending and bonds' rotation which are described by torsion angles. In the analyzed RNA structures, the method finds the longest continuous segments that show similar torsion within a user-defined threshold. The length of the segment is provided as local similarity measure. The method has been implemented as LCS-TA algorithm (Longest Continuous Segments in Torsion Angle space) and is incorporated into our MCQ4Structures application, freely available for download from http://www.cs.put.poznan.pl/tzok/mcq/ . The presented approach ties torsion-angle-based method of structure analysis with the idea of local similarity identification by handling continuous 3D structure segments. The first method, implemented in MCQ4Structures, has been successfully utilized in RNA-Puzzles initiative. The second one, originally applied in Euclidean space, is a component of LGA (Local-Global Alignment) algorithm commonly used in assessing protein models submitted to CASP. This unique combination of concepts implemented in LCS-TA provides a new perspective on structure quality assessment in local and quantitative aspect. A series of computational experiments show the first results of applying our method to comparison of RNA 3D models. LCS-TA can be used for identifying strengths and weaknesses in the prediction of RNA tertiary structures.

There's Waldo! A Normalization Model of Visual Search Predicts Single-Trial Human Fixations in an Object Search Task

PubMed Central

Miconi, Thomas; Groomes, Laura; Kreiman, Gabriel

2016-01-01

When searching for an object in a scene, how does the brain decide where to look next? Visual search theories suggest the existence of a global “priority map” that integrates bottom-up visual information with top-down, target-specific signals. We propose a mechanistic model of visual search that is consistent with recent neurophysiological evidence, can localize targets in cluttered images, and predicts single-trial behavior in a search task. This model posits that a high-level retinotopic area selective for shape features receives global, target-specific modulation and implements local normalization through divisive inhibition. The normalization step is critical to prevent highly salient bottom-up features from monopolizing attention. The resulting activity pattern constitues a priority map that tracks the correlation between local input and target features. The maximum of this priority map is selected as the locus of attention. The visual input is then spatially enhanced around the selected location, allowing object-selective visual areas to determine whether the target is present at this location. This model can localize objects both in array images and when objects are pasted in natural scenes. The model can also predict single-trial human fixations, including those in error and target-absent trials, in a search task involving complex objects. PMID:26092221

Alignment-free detection of horizontal gene transfer between closely related bacterial genomes.

PubMed

Domazet-Lošo, Mirjana; Haubold, Bernhard

2011-09-01

Bacterial epidemics are often caused by strains that have acquired their increased virulence through horizontal gene transfer. Due to this association with disease, the detection of horizontal gene transfer continues to receive attention from microbiologists and bioinformaticians alike. Most software for detecting transfer events is based on alignments of sets of genes or of entire genomes. But despite great advances in the design of algorithms and computer programs, genome alignment remains computationally challenging. We have therefore developed an alignment-free algorithm for rapidly detecting horizontal gene transfer between closely related bacterial genomes. Our implementation of this algorithm is called alfy for "ALignment Free local homologY" and is freely available from http://guanine.evolbio.mpg.de/alfy/. In this comment we demonstrate the application of alfy to the genomes of Staphylococcus aureus. We also argue that-contrary to popular belief and in spite of increasing computer speed-algorithmic optimization is becoming more, not less, important if genome data continues to accumulate at the present rate.

Alignment of the Stanford Linear Collider Arcs: Concepts and results

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pitthan, R.; Bell, B.; Friedsam, H.

1987-02-01

The alignment of the Arcs for the Stanford Linear Collider at SLAC has posed problems in accelerator survey and alignment not encountered before. These problems come less from the tight tolerances of 0.1 mm, although reaching such a tight statistically defined accuracy in a controlled manner is difficult enough, but from the absence of a common reference plane for the Arcs. Traditional circular accelerators, including HERA and LEP, have been designed in one plane referenced to local gravity. For the SLC Arcs no such single plane exists. Methods and concepts developed to solve these and other problems, connected with themore » unique design of SLC, range from the first use of satellites for accelerator alignment, use of electronic laser theodolites for placement of components, computer control of the manual adjustment process, complete automation of the data flow incorporating the most advanced concepts of geodesy, strict separation of survey and alignment, to linear principal component analysis for the final statistical smoothing of the mechanical components.« less

Understanding the nanoscale local buckling behavior of vertically aligned MWCNT arrays with van der Waals interactions

NASA Astrophysics Data System (ADS)

Li, Yupeng; Kim, Hyung-Ick; Wei, Bingqing; Kang, Junmo; Choi, Jae-Boong; Nam, Jae-Do; Suhr, Jonghwan

2015-08-01

The local buckling behavior of vertically aligned carbon nanotubes (VACNTs) has been investigated and interpreted in the view of a collective nanotube response by taking van der Waals interactions into account. To the best of our knowledge, this is the first report on the case of collective VACNT behavior regarding van der Waals force among nanotubes as a lateral support effect during the buckling process. The local buckling propagation and development of VACNTs were experimentally observed and theoretically analyzed by employing finite element modeling with lateral support from van der Waals interactions among nanotubes. Both experimental and theoretical analyses show that VACNTs buckled in the bottom region with many short waves and almost identical wavelengths, indicating a high mode buckling. Furthermore, the propagation and development mechanism of buckling waves follow the wave damping effect.The local buckling behavior of vertically aligned carbon nanotubes (VACNTs) has been investigated and interpreted in the view of a collective nanotube response by taking van der Waals interactions into account. To the best of our knowledge, this is the first report on the case of collective VACNT behavior regarding van der Waals force among nanotubes as a lateral support effect during the buckling process. The local buckling propagation and development of VACNTs were experimentally observed and theoretically analyzed by employing finite element modeling with lateral support from van der Waals interactions among nanotubes. Both experimental and theoretical analyses show that VACNTs buckled in the bottom region with many short waves and almost identical wavelengths, indicating a high mode buckling. Furthermore, the propagation and development mechanism of buckling waves follow the wave damping effect. Electronic supplementary information (ESI) available. See DOI: 10.1039/c5nr03581c

Legislating tolerance: Spain's national public smoking law.

PubMed

Muggli, Monique E; Lockhart, Nikki J; Ebbert, Jon O; Jiménez-Ruiz, Carlos A; Riesco Miranda, Juan Antonio; Hurt, Richard D

2010-02-01

While Spain's national tobacco control legislation prohibits smoking in many indoor public places, the law provides for an exception to the prohibition of smoking by allowing separate seating sections and ventilation options in certain public places such as bars and restaurants, hotels and airports. Accordingly, Spain's law is not aligned with Article 8 Guidelines of the World Health Organization's Framework Convention on Tobacco Control, which requires parties to ensure universal protection against secondhand smoke exposure in all enclosed public places, workplaces and on all means of public transport. Spain's law is currently being promoted by the tobacco companies in other countries as a model for smoke-free legislation. In order to prevent weakening of smoke-free laws in other countries through industry-supported exceptions, we investigated the tactics used by the tobacco companies before the implementation of the new law and assessed the consequences of these actions in the hospitality sector. Internal tobacco industry documents made public through US litigation settlements dating back to the 1980s were searched in 2008-9. Documents show that tobacco companies sought to protect hospitality venues from smoking restrictions by promoting separate seating for smokers and ineffective ventilation technologies, supporting an unenforceable voluntary agreement between the Madrid local government and the hospitality industry, influencing ventilation standards setting and manipulating Spanish media. The Spanish National Assembly should adopt comprehensive smoke-free legislation that does not accommodate the interests of the tobacco industry. In doing so, Spain's smoke-free public places law would be better aligned with the Framework Convention on Tobacco Control.

Optimal word sizes for dissimilarity measures and estimation of the degree of dissimilarity between DNA sequences.

PubMed

Wu, Tiee-Jian; Huang, Ying-Hsueh; Li, Lung-An

2005-11-15

Several measures of DNA sequence dissimilarity have been developed. The purpose of this paper is 3-fold. Firstly, we compare the performance of several word-based or alignment-based methods. Secondly, we give a general guideline for choosing the window size and determining the optimal word sizes for several word-based measures at different window sizes. Thirdly, we use a large-scale simulation method to simulate data from the distribution of SK-LD (symmetric Kullback-Leibler discrepancy). These simulated data can be used to estimate the degree of dissimilarity beta between any pair of DNA sequences. Our study shows (1) for whole sequence similiarity/dissimilarity identification the window size taken should be as large as possible, but probably not >3000, as restricted by CPU time in practice, (2) for each measure the optimal word size increases with window size, (3) when the optimal word size is used, SK-LD performance is superior in both simulation and real data analysis, (4) the estimate beta of beta based on SK-LD can be used to filter out quickly a large number of dissimilar sequences and speed alignment-based database search for similar sequences and (5) beta is also applicable in local similarity comparison situations. For example, it can help in selecting oligo probes with high specificity and, therefore, has potential in probe design for microarrays. The algorithm SK-LD, estimate beta and simulation software are implemented in MATLAB code, and are available at http://www.stat.ncku.edu.tw/tjwu

An integrated organisation-wide data quality management and information governance framework: theoretical underpinnings.

PubMed

Liaw, Siaw-Teng; Pearce, Christopher; Liyanage, Harshana; Liaw, Gladys S S; de Lusignan, Simon

2014-01-01

Increasing investment in eHealth aims to improve cost effectiveness and safety of care. Data extraction and aggregation can create new data products to improve professional practice and provide feedback to improve the quality of source data. A previous systematic review concluded that locally relevant clinical indicators and use of clinical record systems could support clinical governance. We aimed to extend and update the review with a theoretical framework. We searched PubMed, Medline, Web of Science, ABI Inform (Proquest) and Business Source Premier (EBSCO) using the terms curation, information ecosystem, data quality management (DQM), data governance, information governance (IG) and data stewardship. We focused on and analysed the scope of DQM and IG processes, theoretical frameworks, and determinants of the processing, quality assurance, presentation and sharing of data across the enterprise. There are good theoretical reasons for integrated governance, but there is variable alignment of DQM, IG and health system objectives across the health enterprise. Ethical constraints exist that require health information ecosystems to process data in ways that are aligned with improving health and system efficiency and ensuring patient safety. Despite an increasingly 'big-data' environment, DQM and IG in health services are still fragmented across the data production cycle. We extend current work on DQM and IG with a theoretical framework for integrated IG across the data cycle. The dimensions of this theory-based framework would require testing with qualitative and quantitative studies to examine the applicability and utility, along with an evaluation of its impact on data quality across the health enterprise.

Knowledge-Guided Docking of WW Domain Proteins and Flexible Ligands

NASA Astrophysics Data System (ADS)

Lu, Haiyun; Li, Hao; Banu Bte Sm Rashid, Shamima; Leow, Wee Kheng; Liou, Yih-Cherng

Studies of interactions between protein domains and ligands are important in many aspects such as cellular signaling. We present a knowledge-guided approach for docking protein domains and flexible ligands. The approach is applied to the WW domain, a small protein module mediating signaling complexes which have been implicated in diseases such as muscular dystrophy and Liddle’s syndrome. The first stage of the approach employs a substring search for two binding grooves of WW domains and possible binding motifs of peptide ligands based on known features. The second stage aligns the ligand’s peptide backbone to the two binding grooves using a quasi-Newton constrained optimization algorithm. The backbone-aligned ligands produced serve as good starting points to the third stage which uses any flexible docking algorithm to perform the docking. The experimental results demonstrate that the backbone alignment method in the second stage performs better than conventional rigid superposition given two binding constraints. It is also shown that using the backbone-aligned ligands as initial configurations improves the flexible docking in the third stage. The presented approach can also be applied to other protein domains that involve binding of flexible ligand to two or more binding sites.

Anatomic and functional leg-length inequality: A review and recommendation for clinical decision-making. Part II, the functional or unloaded leg-length asymmetry

PubMed Central

Knutson, Gary A

2005-01-01

Background Part II of this review examines the functional "short leg" or unloaded leg length alignment asymmetry, including the relationship between an anatomic and functional leg-length inequality. Based on the reviewed evidence, an outline for clinical decision making regarding functional and anatomic leg-length inequality will be provided. Methods Online databases: Medline, CINAHL and Mantis. Plus library searches for the time frame of 1970–2005 were done using the term "leg-length inequality". Results and Discussion The evidence suggests that an unloaded leg-length asymmetry is a different phenomenon than an anatomic leg-length inequality, and may be due to suprapelvic muscle hypertonicity. Anatomic leg-length inequality and unloaded functional or leg-length alignment asymmetry may interact in a loaded (standing) posture, but not in an unloaded (prone/supine) posture. Conclusion The unloaded, functional leg-length alignment asymmetry is a likely phenomenon, although more research regarding reliability of the measurement procedure and validity relative to spinal dysfunction is needed. Functional leg-length alignment asymmetry should be eliminated before any necessary treatment of anatomic LLI. PMID:16080787

Avalanche for shape and feature-based virtual screening with 3D alignment

NASA Astrophysics Data System (ADS)

Diller, David J.; Connell, Nancy D.; Welsh, William J.

2015-11-01

This report introduces a new ligand-based virtual screening tool called Avalanche that incorporates both shape- and feature-based comparison with three-dimensional (3D) alignment between the query molecule and test compounds residing in a chemical database. Avalanche proceeds in two steps. The first step is an extremely rapid shape/feature based comparison which is used to narrow the focus from potentially millions or billions of candidate molecules and conformations to a more manageable number that are then passed to the second step. The second step is a detailed yet still rapid 3D alignment of the remaining candidate conformations to the query conformation. Using the 3D alignment, these remaining candidate conformations are scored, re-ranked and presented to the user as the top hits for further visualization and evaluation. To provide further insight into the method, the results from two prospective virtual screens are presented which show the ability of Avalanche to identify hits from chemical databases that would likely be missed by common substructure-based or fingerprint-based search methods. The Avalanche method is extended to enable patent landscaping, i.e., structural refinements to improve the patentability of hits for deployment in drug discovery campaigns.

A review of the risk factors for lower extremity overuse injuries in young elite female ballet dancers.

PubMed

Bowerman, Erin Anne; Whatman, Chris; Harris, Nigel; Bradshaw, Elizabeth

2015-06-01

The objective of this study was to review the evidence for selected risk factors of lower extremity overuse injuries in young elite female ballet dancers. An electronic search of key databases from 1969 to July 2013 was conducted using the keywords dancers, ballet dancers, athletes, adolescent, adolescence, young, injury, injuries, risk, overuse, lower limb, lower extremity, lower extremities, growth, maturation, menarche, alignment, and biomechanics. Thirteen published studies were retained for review. Results indicated that there is a high incidence of lower extremity overuse injuries in the target population. Primary risk factors identified included maturation, growth, and poor lower extremity alignment. Strong evidence from well-designed studies indicates that young elite female ballet dancers suffer from delayed onset of growth, maturation, menarche, and menstrual irregularities. However, there is little evidence that this deficit increases the risk of overuse injury, with the exception of stress fractures. Similarly, there is minimal evidence linking poor lower extremity alignment to increased risk of overuse injury. It is concluded that further prospective, longitudinal studies are required to clarify the relationship between growth, maturation, menarche, and lower extremity alignment, and the risk of lower extremity overuse injury in young elite female ballet dancers.

Representation and alignment of sung queries for music information retrieval

NASA Astrophysics Data System (ADS)

Adams, Norman H.; Wakefield, Gregory H.

2005-09-01

The pursuit of robust and rapid query-by-humming systems, which search melodic databases using sung queries, is a common theme in music information retrieval. The retrieval aspect of this database problem has received considerable attention, whereas the front-end processing of sung queries and the data structure to represent melodies has been based on musical intuition and historical momentum. The present work explores three time series representations for sung queries: a sequence of notes, a ``smooth'' pitch contour, and a sequence of pitch histograms. The performance of the three representations is compared using a collection of naturally sung queries. It is found that the most robust performance is achieved by the representation with highest dimension, the smooth pitch contour, but that this representation presents a formidable computational burden. For all three representations, it is necessary to align the query and target in order to achieve robust performance. The computational cost of the alignment is quadratic, hence it is necessary to keep the dimension small for rapid retrieval. Accordingly, iterative deepening is employed to achieve both robust performance and rapid retrieval. Finally, the conventional iterative framework is expanded to adapt the alignment constraints based on previous iterations, further expediting retrieval without degrading performance.

A near-Infrared SETI Experiment: Alignment and Astrometric precision

NASA Astrophysics Data System (ADS)

Duenas, Andres; Maire, Jerome; Wright, Shelley; Drake, Frank D.; Marcy, Geoffrey W.; Siemion, Andrew; Stone, Remington P. S.; Tallis, Melisa; Treffers, Richard R.; Werthimer, Dan

2016-06-01

Beginning in March 2015, a Near-InfraRed Optical SETI (NIROSETI) instrument aiming to search for fast nanosecond laser pulses, has been commissioned on the Nickel 1m-telescope at Lick Observatory. The NIROSETI instrument makes use of an optical guide camera, SONY ICX694 CCD from PointGrey, to align our selected sources into two 200µm near-infrared Avalanche Photo Diodes (APD) with a field-of-view of 2.5"x2.5" each. These APD detectors operate at very fast bandwidths and are able to detect pulse widths extending down into the nanosecond range. Aligning sources onto these relatively small detectors requires characterizing the guide camera plate scale, static optical distortion solution, and relative orientation with respect to the APD detectors. We determined the guide camera plate scale as 55.9+- 2.7 milli-arcseconds/pixel and magnitude limit of 18.15mag (+1.07/-0.58) in V-band. We will present the full distortion solution of the guide camera, orientation, and our alignment method between the camera and the two APDs, and will discuss target selection within the NIROSETI observational campaign, including coordination with Breakthrough Listen.

Error Estimation Techniques to Refine Overlapping Aerial Image Mosaic Processes via Detected Parameters

ERIC Educational Resources Information Center

Bond, William Glenn

2012-01-01

In this paper, I propose to demonstrate a means of error estimation preprocessing in the assembly of overlapping aerial image mosaics. The mosaic program automatically assembles several hundred aerial images from a data set by aligning them, via image registration using a pattern search method, onto a GIS grid. The method presented first locates…

Name that Gene: A Meaningful Computer-Based Genetics Classroom Activity that Incorporates Tolls Used by Real Research Scientists

ERIC Educational Resources Information Center

Wefer, Stephen H.

2003-01-01

"Name That Gene" is a simple classroom activity that incorporates bioinformatics (available biological information) into the classroom using "Basic Logical Alignment Search Tool (BLAST)." An excellent classroom activity involving bioinformatics and "BLAST" has been previously explored using sequences from bacteria, but it is tailored for college…

Evidence-Based Communication Practices for Children with Visual Impairments and Additional Disabilities: An Examination of Single-Subject Design Studies

ERIC Educational Resources Information Center

Parker, Amy T.; Grimmett, Eric S.; Summers, Sharon

2008-01-01

This review examines practices for building effective communication strategies for children with visual impairments, including those with additional disabilities, that have been tested by single-subject design methodology. The authors found 30 studies that met the search criteria and grouped intervention strategies to align any evidence of the…

Adding Statistical Machine Translation Adaptation to Computer-Assisted Translation

DTIC Science & Technology

2013-09-01

are automatically searched and used to suggest possible translations; (2) spell-checkers; (3) glossaries; (4) dictionaries ; (5) alignment and...matching against TMs to propose translations; spell-checking, glossary, and dictionary look-up; support for multiple file formats; regular expressions...on Telecommunications. Tehran, 2012, 822–826. Bertoldi, N.; Federico, M. Domain Adaptation for Statistical Machine Translation with Monolingual

An unsupervised video foreground co-localization and segmentation process by incorporating motion cues and frame features

NASA Astrophysics Data System (ADS)

Zhang, Chao; Zhang, Qian; Zheng, Chi; Qiu, Guoping

2018-04-01

Video foreground segmentation is one of the key problems in video processing. In this paper, we proposed a novel and fully unsupervised approach for foreground object co-localization and segmentation of unconstrained videos. We firstly compute both the actual edges and motion boundaries of the video frames, and then align them by their HOG feature maps. Then, by filling the occlusions generated by the aligned edges, we obtained more precise masks about the foreground object. Such motion-based masks could be derived as the motion-based likelihood. Moreover, the color-base likelihood is adopted for the segmentation process. Experimental Results show that our approach outperforms most of the State-of-the-art algorithms.

Dynamical formation of spatially localized arrays of aligned nanowires in plastic films with magnetic anisotropy.

PubMed

Fragouli, Despina; Buonsanti, Raffaella; Bertoni, Giovanni; Sangregorio, Claudio; Innocenti, Claudia; Falqui, Andrea; Gatteschi, Dante; Cozzoli, Pantaleo Davide; Athanassiou, Athanassia; Cingolani, Roberto

2010-04-27

We present a simple technique for magnetic-field-induced formation, assembling, and positioning of magnetic nanowires in a polymer film. Starting from a polymer/iron oxide nanoparticle casted solution that is allowed to dry along with the application of a weak magnetic field, nanocomposite films incorporating aligned nanocrystal-built nanowire arrays are obtained. The control of the dimensions of the nanowires and of their localization across the polymer matrix is achieved by varying the duration of the applied magnetic field, in combination with the evaporation dynamics. These multifunctional anisotropic free-standing nanocomposite films, which demonstrate high magnetic anisotropy, can be used in a wide field of technological applications, ranging from sensors to microfluidics and magnetic devices.

D-score: a search engine independent MD-score.

PubMed

Vaudel, Marc; Breiter, Daniela; Beck, Florian; Rahnenführer, Jörg; Martens, Lennart; Zahedi, René P

2013-03-01

While peptides carrying PTMs are routinely identified in gel-free MS, the localization of the PTMs onto the peptide sequences remains challenging. Search engine scores of secondary peptide matches have been used in different approaches in order to infer the quality of site inference, by penalizing the localization whenever the search engine similarly scored two candidate peptides with different site assignments. In the present work, we show how the estimation of posterior error probabilities for peptide candidates allows the estimation of a PTM score called the D-score, for multiple search engine studies. We demonstrate the applicability of this score to three popular search engines: Mascot, OMSSA, and X!Tandem, and evaluate its performance using an already published high resolution data set of synthetic phosphopeptides. For those peptides with phosphorylation site inference uncertainty, the number of spectrum matches with correctly localized phosphorylation increased by up to 25.7% when compared to using Mascot alone, although the actual increase depended on the fragmentation method used. Since this method relies only on search engine scores, it can be readily applied to the scoring of the localization of virtually any modification at no additional experimental or in silico cost. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

PFAAT version 2.0: a tool for editing, annotating, and analyzing multiple sequence alignments.

PubMed

Caffrey, Daniel R; Dana, Paul H; Mathur, Vidhya; Ocano, Marco; Hong, Eun-Jong; Wang, Yaoyu E; Somaroo, Shyamal; Caffrey, Brian E; Potluri, Shobha; Huang, Enoch S

2007-10-11

By virtue of their shared ancestry, homologous sequences are similar in their structure and function. Consequently, multiple sequence alignments are routinely used to identify trends that relate to function. This type of analysis is particularly productive when it is combined with structural and phylogenetic analysis. Here we describe the release of PFAAT version 2.0, a tool for editing, analyzing, and annotating multiple sequence alignments. Support for multiple annotations is a key component of this release as it provides a framework for most of the new functionalities. The sequence annotations are accessible from the alignment and tree, where they are typically used to label sequences or hyperlink them to related databases. Sequence annotations can be created manually or extracted automatically from UniProt entries. Once a multiple sequence alignment is populated with sequence annotations, sequences can be easily selected and sorted through a sophisticated search dialog. The selected sequences can be further analyzed using statistical methods that explicitly model relationships between the sequence annotations and residue properties. Residue annotations are accessible from the alignment viewer and are typically used to designate binding sites or properties for a particular residue. Residue annotations are also searchable, and allow one to quickly select alignment columns for further sequence analysis, e.g. computing percent identities. Other features include: novel algorithms to compute sequence conservation, mapping conservation scores to a 3D structure in Jmol, displaying secondary structure elements, and sorting sequences by residue composition. PFAAT provides a framework whereby end-users can specify knowledge for a protein family in the form of annotation. The annotations can be combined with sophisticated analysis to test hypothesis that relate to sequence, structure and function.

Genetic algorithms for protein threading.

PubMed

Yadgari, J; Amir, A; Unger, R

1998-01-01

Despite many years of efforts, a direct prediction of protein structure from sequence is still not possible. As a result, in the last few years researchers have started to address the "inverse folding problem": Identifying and aligning a sequence to the fold with which it is most compatible, a process known as "threading". In two meetings in which protein folding predictions were objectively evaluated, it became clear that threading as a concept promises a real breakthrough, but that much improvement is still needed in the technique itself. Threading is a NP-hard problem, and thus no general polynomial solution can be expected. Still a practical approach with demonstrated ability to find optimal solutions in many cases, and acceptable solutions in other cases, is needed. We applied the technique of Genetic Algorithms in order to significantly improve the ability of threading algorithms to find the optimal alignment of a sequence to a structure, i.e. the alignment with the minimum free energy. A major progress reported here is the design of a representation of the threading alignment as a string of fixed length. With this representation validation of alignments and genetic operators are effectively implemented. Appropriate data structure and parameters have been selected. It is shown that Genetic Algorithm threading is effective and is able to find the optimal alignment in a few test cases. Furthermore, the described algorithm is shown to perform well even without pre-definition of core elements. Existing threading methods are dependent on such constraints to make their calculations feasible. But the concept of core elements is inherently arbitrary and should be avoided if possible. While a rigorous proof is hard to submit yet an, we present indications that indeed Genetic Algorithm threading is capable of finding consistently good solutions of full alignments in search spaces of size up to 10(70).

Improved measurements of RNA structure conservation with generalized centroid estimators.

PubMed

Okada, Yohei; Saito, Yutaka; Sato, Kengo; Sakakibara, Yasubumi

2011-01-01

Identification of non-protein-coding RNAs (ncRNAs) in genomes is a crucial task for not only molecular cell biology but also bioinformatics. Secondary structures of ncRNAs are employed as a key feature of ncRNA analysis since biological functions of ncRNAs are deeply related to their secondary structures. Although the minimum free energy (MFE) structure of an RNA sequence is regarded as the most stable structure, MFE alone could not be an appropriate measure for identifying ncRNAs since the free energy is heavily biased by the nucleotide composition. Therefore, instead of MFE itself, several alternative measures for identifying ncRNAs have been proposed such as the structure conservation index (SCI) and the base pair distance (BPD), both of which employ MFE structures. However, these measurements are unfortunately not suitable for identifying ncRNAs in some cases including the genome-wide search and incur high false discovery rate. In this study, we propose improved measurements based on SCI and BPD, applying generalized centroid estimators to incorporate the robustness against low quality multiple alignments. Our experiments show that our proposed methods achieve higher accuracy than the original SCI and BPD for not only human-curated structural alignments but also low quality alignments produced by CLUSTAL W. Furthermore, the centroid-based SCI on CLUSTAL W alignments is more accurate than or comparable with that of the original SCI on structural alignments generated with RAF, a high quality structural aligner, for which twofold expensive computational time is required on average. We conclude that our methods are more suitable for genome-wide alignments which are of low quality from the point of view on secondary structures than the original SCI and BPD.

Spontaneous Magnetic Alignment by Yearling Snapping Turtles: Rapid Association of Radio Frequency Dependent Pattern of Magnetic Input with Novel Surroundings

PubMed Central

Landler, Lukas; Painter, Michael S.; Youmans, Paul W.; Hopkins, William A.; Phillips, John B.

2015-01-01

We investigated spontaneous magnetic alignment (SMA) by juvenile snapping turtles using exposure to low-level radio frequency (RF) fields at the Larmor frequency to help characterize the underlying sensory mechanism. Turtles, first introduced to the testing environment without the presence of RF aligned consistently towards magnetic north when subsequent magnetic testing conditions were also free of RF (‘RF off → RF off’), but were disoriented when subsequently exposed to RF (‘RF off → RF on’). In contrast, animals initially introduced to the testing environment with RF present were disoriented when tested without RF (‘RF on → RF off’), but aligned towards magnetic south when tested with RF (‘RF on → RF on’). Sensitivity of the SMA response of yearling turtles to RF is consistent with the involvement of a radical pair mechanism. Furthermore, the effect of RF appears to result from a change in the pattern of magnetic input, rather than elimination of magnetic input altogether, as proposed to explain similar effects in other systems/organisms. The findings show that turtles first exposed to a novel environment form a lasting association between the pattern of magnetic input and their surroundings. However, under natural conditions turtles would never experience a change in the pattern of magnetic input. Therefore, if turtles form a similar association of magnetic cues with the surroundings each time they encounter unfamiliar habitat, as seems likely, the same pattern of magnetic input would be associated with multiple sites/localities. This would be expected from a sensory input that functions as a global reference frame, helping to place multiple locales (i.e., multiple local landmark arrays) into register to form a global map of familiar space. PMID:25978736

Spontaneous magnetic alignment by yearling snapping turtles: rapid association of radio frequency dependent pattern of magnetic input with novel surroundings.

PubMed

Landler, Lukas; Painter, Michael S; Youmans, Paul W; Hopkins, William A; Phillips, John B

2015-01-01

We investigated spontaneous magnetic alignment (SMA) by juvenile snapping turtles using exposure to low-level radio frequency (RF) fields at the Larmor frequency to help characterize the underlying sensory mechanism. Turtles, first introduced to the testing environment without the presence of RF aligned consistently towards magnetic north when subsequent magnetic testing conditions were also free of RF ('RF off → RF off'), but were disoriented when subsequently exposed to RF ('RF off → RF on'). In contrast, animals initially introduced to the testing environment with RF present were disoriented when tested without RF ('RF on → RF off'), but aligned towards magnetic south when tested with RF ('RF on → RF on'). Sensitivity of the SMA response of yearling turtles to RF is consistent with the involvement of a radical pair mechanism. Furthermore, the effect of RF appears to result from a change in the pattern of magnetic input, rather than elimination of magnetic input altogether, as proposed to explain similar effects in other systems/organisms. The findings show that turtles first exposed to a novel environment form a lasting association between the pattern of magnetic input and their surroundings. However, under natural conditions turtles would never experience a change in the pattern of magnetic input. Therefore, if turtles form a similar association of magnetic cues with the surroundings each time they encounter unfamiliar habitat, as seems likely, the same pattern of magnetic input would be associated with multiple sites/localities. This would be expected from a sensory input that functions as a global reference frame, helping to place multiple locales (i.e., multiple local landmark arrays) into register to form a global map of familiar space.

EGenBio: A Data Management System for Evolutionary Genomics and Biodiversity

PubMed Central

Nahum, Laila A; Reynolds, Matthew T; Wang, Zhengyuan O; Faith, Jeremiah J; Jonna, Rahul; Jiang, Zhi J; Meyer, Thomas J; Pollock, David D

2006-01-01

Background Evolutionary genomics requires management and filtering of large numbers of diverse genomic sequences for accurate analysis and inference on evolutionary processes of genomic and functional change. We developed Evolutionary Genomics and Biodiversity (EGenBio; ) to begin to address this. Description EGenBio is a system for manipulation and filtering of large numbers of sequences, integrating curated sequence alignments and phylogenetic trees, managing evolutionary analyses, and visualizing their output. EGenBio is organized into three conceptual divisions, Evolution, Genomics, and Biodiversity. The Genomics division includes tools for selecting pre-aligned sequences from different genes and species, and for modifying and filtering these alignments for further analysis. Species searches are handled through queries that can be modified based on a tree-based navigation system and saved. The Biodiversity division contains tools for analyzing individual sequences or sequence alignments, whereas the Evolution division contains tools involving phylogenetic trees. Alignments are annotated with analytical results and modification history using our PRAED format. A miscellaneous Tools section and Help framework are also available. EGenBio was developed around our comparative genomic research and a prototype database of mtDNA genomes. It utilizes MySQL-relational databases and dynamic page generation, and calls numerous custom programs. Conclusion EGenBio was designed to serve as a platform for tools and resources to ease combined analysis in evolution, genomics, and biodiversity. PMID:17118150

Evolutionary profiles from the QR factorization of multiple sequence alignments

PubMed Central

Sethi, Anurag; O'Donoghue, Patrick; Luthey-Schulten, Zaida

2005-01-01

We present an algorithm to generate complete evolutionary profiles that represent the topology of the molecular phylogenetic tree of the homologous group. The method, based on the multidimensional QR factorization of numerically encoded multiple sequence alignments, removes redundancy from the alignments and orders the protein sequences by increasing linear dependence, resulting in the identification of a minimal basis set of sequences that spans the evolutionary space of the homologous group of proteins. We observe a general trend that these smaller, more evolutionarily balanced profiles have comparable and, in many cases, better performance in database searches than conventional profiles containing hundreds of sequences, constructed in an iterative and computationally intensive procedure. For more diverse families or superfamilies, with sequence identity <30%, structural alignments, based purely on the geometry of the protein structures, provide better alignments than pure sequence-based methods. Merging the structure and sequence information allows the construction of accurate profiles for distantly related groups. These structure-based profiles outperformed other sequence-based methods for finding distant homologs and were used to identify a putative class II cysteinyl-tRNA synthetase (CysRS) in several archaea that eluded previous annotation studies. Phylogenetic analysis showed the putative class II CysRSs to be a monophyletic group and homology modeling revealed a constellation of active site residues similar to that in the known class I CysRS. PMID:15741270

Scrutinizing the alignment limit in two-Higgs-doublet models. II. mH=125 GeV

NASA Astrophysics Data System (ADS)

Bernon, Jérémy; Gunion, John F.; Haber, Howard E.; Jiang, Yun; Kraml, Sabine

2016-02-01

In the alignment limit of a multidoublet Higgs sector, one of the Higgs mass eigenstates aligns in field space with the direction of the scalar field vacuum expectation values, and its couplings approach those of the Standard Model (SM) Higgs boson. We consider C P -conserving two-Higgs-doublet models (2HDMs) of type I and type II near the alignment limit in which the heavier of the two C P -even Higgs bosons, H , is the SM-like state observed with a mass of 125 GeV, and the couplings of H to gauge bosons approach those of the SM. We review the theoretical structure and analyze the phenomenological implications of this particular realization of the alignment limit, where decoupling of the extra states cannot occur given that the lighter C P -even state h must, by definition, have a mass below 125 GeV. For the numerical analysis, we perform scans of the 2HDM parameter space employing the software packages 2hdmc and lilith, taking into account all relevant pre-LHC constraints, constraints from the measurements of the 125 GeV Higgs signal at the LHC, as well as the most recent limits coming from searches for other Higgs-like states. Implications for Run 2 at the LHC, including expectations for observing the other scalar states, are also discussed.

Location of the Common Peroneal Nerve in Valgus Knees-Is the Reported Safe Zone for Well-Aligned Knees Applicable?

PubMed

Yang, Dejin; Shao, Hongyi; Zhou, Yixin; Tang, Hao; Guo, Shengjie

2017-11-01

Lateral soft-tissue release can jeopardize the common peroneal nerve (CPN) in total knee arthroplasty for valgus knees. Previous studies reporting safe zones to protect the CPN were based on well-aligned knees. We conducted this study to compare the localization of the CPN in well-aligned knees and in valgus knees. We conducted a consecutive 3-dimensional radiographic study on magnetic resonance images of 58 well-aligned knees and 39 valgus knees. We measured the distance between the CPN and the tibia, as well as the mediolateral, anteroposterior, and angular location of the CPN. We compared the results between well-aligned knees and valgus knees. We found that there is an increased distance between the CPN and the tibia at the level of the tibial cut, but not at the joint line in valgus knees. It is safer to release the posterolateral capsule at the tibial side than at the level above this. The angular location and the mediolateral or anteroposterior location of the CPN in valgus knees are similar to those of well-aligned knees. The location of the CPN in valgus knees is similar to that in well-aligned knees. The previously reported safe zone in well-aligned knees is applicable in valgus knees to protect the CPN. Copyright © 2017 Elsevier Inc. All rights reserved.

Revisiting the phylogeny of Zoanthidea (Cnidaria: Anthozoa): Staggered alignment of hypervariable sequences improves species tree inference.

PubMed

Swain, Timothy D

2018-01-01

The recent rapid proliferation of novel taxon identification in the Zoanthidea has been accompanied by a parallel propagation of gene trees as a tool of species discovery, but not a corresponding increase in our understanding of phylogeny. This disparity is caused by the trade-off between the capabilities of automated DNA sequence alignment and data content of genes applied to phylogenetic inference in this group. Conserved genes or segments are easily aligned across the order, but produce poorly resolved trees; hypervariable genes or segments contain the evolutionary signal necessary for resolution and robust support, but sequence alignment is daunting. Staggered alignments are a form of phylogeny-informed sequence alignment composed of a mosaic of local and universal regions that allow phylogenetic inference to be applied to all nucleotides from both hypervariable and conserved gene segments. Comparisons between species tree phylogenies inferred from all data (staggered alignment) and hypervariable-excluded data (standard alignment) demonstrate improved confidence and greater topological agreement with other sources of data for the complete-data tree. This novel phylogeny is the most comprehensive to date (in terms of taxa and data) and can serve as an expandable tool for evolutionary hypothesis testing in the Zoanthidea. Spanish language abstract available in Text S1. Translation by L. O. Swain, DePaul University, Chicago, Illinois, 60604, USA. Copyright © 2017 Elsevier Inc. All rights reserved.

Optimizing exoplanet transit searches around low-mass stars with inclination constraints

NASA Astrophysics Data System (ADS)

Herrero, E.; Ribas, I.; Jordi, C.; Guinan, E. F.; Engle, S. G.

2012-01-01

Aims: We investigate a method to increase the efficiency of a targeted exoplanet search with the transit technique by preselecting a subset of candidates from large catalogs of stars. Assuming spin-orbit alignment, this can be achieved by considering stars that have a higher probability to be oriented nearly equator-on (inclination close to 90°). Methods: We used activity-rotation velocity relations for low-mass stars with a convective envelope to study the dependence of the position in the activity-vsini diagram on the stellar axis inclination. We composed a catalog of G-, K-, M-type main-sequence simulated stars using isochrones, an isotropic inclination distribution and empirical relations to obtain their rotation periods and activity indexes. Then the activity-vsini diagram was completed and statistics were applied to trace the areas containing the higher ratio of stars with inclinations above 80°. A similar statistics was applied to stars from real catalogs with log(R'HK) and vsini data to find their probability of being oriented equator-on. Results: We present our method to generate the simulated star catalog and the subsequent statistics to find the highly inclined stars from real catalogs using the activity-vsini diagram. Several catalogs from the literature are analyzed and a subsample of stars with the highest probability of being equator-on is presented. Conclusions: Assuming spin-orbit alignment, the efficiency of an exoplanet transit search in the resulting subsample of probably highly inclined stars is estimated to be two to three times higher than with a general search without preselection. Table 4 is only available at the CDS via anonymous ftp to cdsarc.u-strasbg.fr (130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/537/A147

Localization Versus Abstraction: A Comparison of Two Search Reduction Techniques

NASA Technical Reports Server (NTRS)

Lansky, Amy L.

1992-01-01

There has been much recent work on the use of abstraction to improve planning behavior and cost. Another technique for dealing with the inherently explosive cost of planning is localization. This paper compares the relative strengths of localization and abstraction in reducing planning search cost. In particular, localization is shown to subsume abstraction. Localization techniques can model the various methods of abstraction that have been used, but also provide a much more flexible framework, with a broader range of benefits.

Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems.

PubMed

Mavrovouniotis, Michalis; Muller, Felipe M; Yang, Shengxiang

2016-06-13

For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle such problems due to their adaptation capabilities. It has been shown that the integration of local search operators can significantly improve the performance of ACO. In this paper, a memetic ACO algorithm, where a local search operator (called unstring and string) is integrated into ACO, is proposed to address DTSPs. The best solution from ACO is passed to the local search operator, which removes and inserts cities in such a way that improves the solution quality. The proposed memetic ACO algorithm is designed to address both symmetric and asymmetric DTSPs. The experimental results show the efficiency of the proposed memetic algorithm for addressing DTSPs in comparison with other state-of-the-art algorithms.

Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.

PubMed

Mohsen, Abdulqader M

2016-01-01

Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simulated annealing (SA) and mutation operator have the jumping ability and global convergence; and local search has the ability to speed up the convergence. Therefore, this paper proposed a hybrid ACO algorithm integrating the advantages of ACO, SA, mutation operator, and local search procedure to solve the traveling salesman problem. The core of algorithm is based on the ACO. SA and mutation operator were used to increase the ants population diversity from time to time and the local search was used to exploit the current search area efficiently. The comparative experiments, using 24 TSP instances from TSPLIB, show that the proposed algorithm outperformed some well-known algorithms in the literature in terms of solution quality.

Imageless navigation system does not improve component rotational alignment in total knee arthroplasty.

PubMed

Cheng, Tao; Zhang, Guoyou; Zhang, Xianlong

2011-12-01

The aim of computer-assisted surgery is to improve accuracy and limit the range of surgical variability. However, a worldwide debate exists regarding the importance and usefulness of computer-assisted navigation for total knee arthroplasty (TKA). The main purpose of this study is to summarize and compare the radiographic outcomes of TKA performed using imageless computer-assisted navigation compared with conventional techniques. An electronic search of PubMed, EMBASE, Web of Science, and Cochrane library databases was made, in addition to manual search of major orthopedic journals. A meta-analysis of 29 quasi-randomized/randomized controlled trials (quasi-RCTs/RCTs) and 11 prospective comparative studies was conducted through a random effects model. Additional a priori sources of clinical heterogeneity were evaluated by subgroup analysis with regard to radiographic methods. When the outlier cut-off value of lower limb axis was defined as ±2° or ±3° from the neutral, the postoperative full-length radiographs demonstrated that the risk ratio was 0.54 or 0.39, respectively, which were in favor of the navigated group. When the cut-off value used for the alignment in the coronal and sagittal plane was 2° or 3°, imageless navigation significantly reduced the outlier rate of the femoral and tibial components compared with the conventional group. Notably, computed tomography scans demonstrated no statistically significant differences between the two groups regarding the outliers in the rotational alignment of the femoral and tibial components; however, there was strong statistical heterogeneity. Our results indicated that imageless computer-assisted navigation systems improve lower limb axis and component orientation in the coronal and sagittal planes, but not the rotational alignment in TKA. Further multiple-center clinical trials with long-term follow-up are needed to determine differences in the clinical and functional outcomes of knee arthroplasties performed using computer-assisted techniques. Copyright © 2011 Elsevier Inc. All rights reserved.

PASS2: an automated database of protein alignments organised as structural superfamilies.

PubMed

Bhaduri, Anirban; Pugalenthi, Ganesan; Sowdhamini, Ramanathan

2004-04-02

The functional selection and three-dimensional structural constraints of proteins in nature often relates to the retention of significant sequence similarity between proteins of similar fold and function despite poor sequence identity. Organization of structure-based sequence alignments for distantly related proteins, provides a map of the conserved and critical regions of the protein universe that is useful for the analysis of folding principles, for the evolutionary unification of protein families and for maximizing the information return from experimental structure determination. The Protein Alignment organised as Structural Superfamily (PASS2) database represents continuously updated, structural alignments for evolutionary related, sequentially distant proteins. An automated and updated version of PASS2 is, in direct correspondence with SCOP 1.63, consisting of sequences having identity below 40% among themselves. Protein domains have been grouped into 628 multi-member superfamilies and 566 single member superfamilies. Structure-based sequence alignments for the superfamilies have been obtained using COMPARER, while initial equivalencies have been derived from a preliminary superposition using LSQMAN or STAMP 4.0. The final sequence alignments have been annotated for structural features using JOY4.0. The database is supplemented with sequence relatives belonging to different genomes, conserved spatially interacting and structural motifs, probabilistic hidden markov models of superfamilies based on the alignments and useful links to other databases. Probabilistic models and sensitive position specific profiles obtained from reliable superfamily alignments aid annotation of remote homologues and are useful tools in structural and functional genomics. PASS2 presents the phylogeny of its members both based on sequence and structural dissimilarities. Clustering of members allows us to understand diversification of the family members. The search engine has been improved for simpler browsing of the database. The database resolves alignments among the structural domains consisting of evolutionarily diverged set of sequences. Availability of reliable sequence alignments of distantly related proteins despite poor sequence identity and single-member superfamilies permit better sampling of structures in libraries for fold recognition of new sequences and for the understanding of protein structure-function relationships of individual superfamilies. PASS2 is accessible at http://www.ncbs.res.in/~faculty/mini/campass/pass2.html

Escalated convergent artificial bee colony

NASA Astrophysics Data System (ADS)

Jadon, Shimpi Singh; Bansal, Jagdish Chand; Tiwari, Ritu

2016-03-01

Artificial bee colony (ABC) optimisation algorithm is a recent, fast and easy-to-implement population-based meta heuristic for optimisation. ABC has been proved a rival algorithm with some popular swarm intelligence-based algorithms such as particle swarm optimisation, firefly algorithm and ant colony optimisation. The solution search equation of ABC is influenced by a random quantity which helps its search process in exploration at the cost of exploitation. In order to find a fast convergent behaviour of ABC while exploitation capability is maintained, in this paper basic ABC is modified in two ways. First, to improve exploitation capability, two local search strategies, namely classical unidimensional local search and levy flight random walk-based local search are incorporated with ABC. Furthermore, a new solution search strategy, namely stochastic diffusion scout search is proposed and incorporated into the scout bee phase to provide more chance to abandon solution to improve itself. Efficiency of the proposed algorithm is tested on 20 benchmark test functions of different complexities and characteristics. Results are very promising and they prove it to be a competitive algorithm in the field of swarm intelligence-based algorithms.

Advanced fitness landscape analysis and the performance of memetic algorithms.

PubMed

Merz, Peter

2004-01-01

Memetic algorithms (MAs) have demonstrated very effective in combinatorial optimization. This paper offers explanations as to why this is so by investigating the performance of MAs in terms of efficiency and effectiveness. A special class of MAs is used to discuss efficiency and effectiveness for local search and evolutionary meta-search. It is shown that the efficiency of MAs can be increased drastically with the use of domain knowledge. However, effectiveness highly depends on the structure of the problem. As is well-known, identifying this structure is made easier with the notion of fitness landscapes: the local properties of the fitness landscape strongly influence the effectiveness of the local search while the global properties strongly influence the effectiveness of the evolutionary meta-search. This paper also introduces new techniques for analyzing the fitness landscapes of combinatorial problems; these techniques focus on the investigation of random walks in the fitness landscape starting at locally optimal solutions as well as on the escape from the basins of attractions of current local optima. It is shown for NK-landscapes and landscapes of the unconstrained binary quadratic programming problem (BQP) that a random walk to another local optimum can be used to explain the efficiency of recombination in comparison to mutation. Moreover, the paper shows that other aspects like the size of the basins of attractions of local optima are important for the efficiency of MAs and a local search escape analysis is proposed. These simple analysis techniques have several advantages over previously proposed statistical measures and provide valuable insight into the behaviour of MAs on different kinds of landscapes.

CORAL: aligning conserved core regions across domain families.

PubMed

Fong, Jessica H; Marchler-Bauer, Aron

2009-08-01

Homologous protein families share highly conserved sequence and structure regions that are frequent targets for comparative analysis of related proteins and families. Many protein families, such as the curated domain families in the Conserved Domain Database (CDD), exhibit similar structural cores. To improve accuracy in aligning such protein families, we propose a profile-profile method CORAL that aligns individual core regions as gap-free units. CORAL computes optimal local alignment of two profiles with heuristics to preserve continuity within core regions. We benchmarked its performance on curated domains in CDD, which have pre-defined core regions, against COMPASS, HHalign and PSI-BLAST, using structure superpositions and comprehensive curator-optimized alignments as standards of truth. CORAL improves alignment accuracy on core regions over general profile methods, returning a balanced score of 0.57 for over 80% of all domain families in CDD, compared with the highest balanced score of 0.45 from other methods. Further, CORAL provides E-values to aid in detecting homologous protein families and, by respecting block boundaries, produces alignments with improved 'readability' that facilitate manual refinement. CORAL will be included in future versions of the NCBI Cn3D/CDTree software, which can be downloaded at http://www.ncbi.nlm.nih.gov/Structure/cdtree/cdtree.shtml. Supplementary data are available at Bioinformatics online.

Pitch contour matching and interactional alignment across turns: an acoustic investigation.

PubMed

Gorisch, Jan; Wells, Bill; Brown, Guy J

2012-03-01

In order to explore the influence of context on the phonetic design of talk-in-interaction, we investigated the pitch characteristics of short turns (insertions) that are produced by one speaker between turns from another speaker. We investigated the hypothesis that the speaker of the insertion designs her turn as a pitch match to the prior turn in order to align with the previous speaker's agenda, whereas non-matching displays that the speaker of the insertion is non-aligning, for example to initiate a new action. Data were taken from the AMI meeting corpus, focusing on the spontaneous talk of first-language English participants. Using sequential analysis, 177 insertions were classified as either aligning or non-aligning in accordance with definitions of these terms in the Conversation Analysis literature. The degree of similarity between the pitch contour of the insertion and that of the prior speaker's turn was measured, using a new technique that integrates normalized F0 and intensity information. The results showed that aligning insertions were significantly more similar to the immediately preceding turn, in terms of pitch contour, than were non-aligning insertions. This supports the view that choice of pitch contour is managed locally, rather than by reference to an intonational lexicon.

Refinement procedure for the image alignment in high-resolution electron tomography.

PubMed

Houben, L; Bar Sadan, M

2011-01-01

High-resolution electron tomography from a tilt series of transmission electron microscopy images requires an accurate image alignment procedure in order to maximise the resolution of the tomogram. This is the case in particular for ultra-high resolution where even very small misalignments between individual images can dramatically reduce the fidelity of the resultant reconstruction. A tomographic-reconstruction based and marker-free method is proposed, which uses an iterative optimisation of the tomogram resolution. The method utilises a search algorithm that maximises the contrast in tomogram sub-volumes. Unlike conventional cross-correlation analysis it provides the required correlation over a large tilt angle separation and guarantees a consistent alignment of images for the full range of object tilt angles. An assessment based on experimental reconstructions shows that the marker-free procedure is competitive to the reference of marker-based procedures at lower resolution and yields sub-pixel accuracy even for simulated high-resolution data. Copyright © 2011 Elsevier B.V. All rights reserved.

Phase Retrieval Using a Genetic Algorithm on the Systematic Image-Based Optical Alignment Testbed

NASA Technical Reports Server (NTRS)

Taylor, Jaime R.

2003-01-01

NASA s Marshall Space Flight Center s Systematic Image-Based Optical Alignment (SIBOA) Testbed was developed to test phase retrieval algorithms and hardware techniques. Individuals working with the facility developed the idea of implementing phase retrieval by breaking the determination of the tip/tilt of each mirror apart from the piston motion (or translation) of each mirror. Presented in this report is an algorithm that determines the optimal phase correction associated only with the piston motion of the mirrors. A description of the Phase Retrieval problem is first presented. The Systematic Image-Based Optical Alignment (SIBOA) Testbeb is then described. A Discrete Fourier Transform (DFT) is necessary to transfer the incoming wavefront (or estimate of phase error) into the spatial frequency domain to compare it with the image. A method for reducing the DFT to seven scalar/matrix multiplications is presented. A genetic algorithm is then used to search for the phase error. The results of this new algorithm on a test problem are presented.

Push-Pull and Feedback Mechanisms Can Align Signaling System Outputs with Inputs.

PubMed

Andrews, Steven S; Peria, William J; Yu, Richard C; Colman-Lerner, Alejandro; Brent, Roger

2016-11-23

Many cell signaling systems, including the yeast pheromone response system, exhibit "dose-response alignment" (DoRA), in which output of one or more downstream steps closely matches the fraction of occupied receptors. DoRA can improve the fidelity of transmitted dose information. Here, we searched systematically for biochemical network topologies that produced DoRA. Most networks, including many containing feedback and feedforward loops, could not produce DoRA. However, networks including "push-pull" mechanisms, in which the active form of a signaling species stimulates downstream activity and the nominally inactive form reduces downstream activity, enabled perfect DoRA. Networks containing feedbacks enabled DoRA, but only if they also compared feedback to input and adjusted output to match. Our results establish push-pull as a non-feedback mechanism to align output with variable input and maximize information transfer in signaling systems. They also suggest genetic approaches to determine whether particular signaling systems use feedback or push-pull control. Copyright © 2016 Elsevier Inc. All rights reserved.

Optimizing exoplanet transit searches

NASA Astrophysics Data System (ADS)

Herrero, E.; Ribas, I.; Jordi, C.

2013-05-01

Exoplanet searches using the transit technique are nowadays providing a great number of findings. Most exoplanet transit detection programs that are currently underway are focused on large catalogs of stars with no pre-selection. This necessarily makes such surveys quite inefficient, because huge amounts of data are processed for a relatively low transiting planet yield. In this work we investigate a method to increase the efficiency of a targeted exoplanet search with the transit technique by preselecting a subset of candidates from large catalogs of stars. Assuming spin-orbit alignment, this can be done by considering stars that have higher probability to be oriented nearly equator-on (inclination close to 90°). We use activity-rotation velocity relations for low-mass stars to study the dependence of the position in the activity - v sin(i) diagram on the stellar axis inclination. We compose a catalog of G-, K-, M-type main sequence simulated stars using isochrones, an isotropic inclination distribution and empirical relations to obtain their rotation periods and activity indexes. Then the activity-vsini diagram is filled and statistics are applied to trace the areas containing the higher ratio of stars with inclinations above 80°. A similar statistics is applied to stars from real catalogs with log(R'_{HK}) and v sin(i) data to find their probability of being equator-on. We present the method used to generate the simulated star catalog and the subsequent statistics to find the highly inclined stars from real catalogs using the activity-v sin(i) diagram. Several catalogs from the literature are analysed and a subsample of stars with the highest probability of being equator-on is presented. Assuming spin-orbit alignment, the efficiency of an exoplanet transit search in the resulting subsample of probably highly inclined stars is estimated to be two to three times higher than with a global search with no pre-selection.

Going, Going, Gone: Localizing Abrupt Offsets of Moving Objects

ERIC Educational Resources Information Center

Maus, Gerrit W.; Nijhawan, Romi

2009-01-01

When a moving object abruptly disappears, this profoundly influences its localization by the visual system. In Experiment 1, 2 aligned objects moved across the screen, and 1 of them abruptly disappeared. Observers reported seeing the objects misaligned at the time of the offset, with the continuing object leading. Experiment 2 showed that the…

Local relative density modulates failure and strength in vertically aligned carbon nanotubes.

PubMed

Pathak, Siddhartha; Mohan, Nisha; Decolvenaere, Elizabeth; Needleman, Alan; Bedewy, Mostafa; Hart, A John; Greer, Julia R

2013-10-22

Micromechanical experiments, image analysis, and theoretical modeling revealed that local failure events and compressive stresses of vertically aligned carbon nanotubes (VACNTs) were uniquely linked to relative density gradients. Edge detection analysis of systematically obtained scanning electron micrographs was used to quantify a microstructural figure-of-merit related to relative local density along VACNT heights. Sequential bottom-to-top buckling and hardening in stress-strain response were observed in samples with smaller relative density at the bottom. When density gradient was insubstantial or reversed, bottom regions always buckled last, and a flat stress plateau was obtained. These findings were consistent with predictions of a 2D material model based on a viscoplastic solid with plastic non-normality and a hardening-softening-hardening plastic flow relation. The hardening slope in compression generated by the model was directly related to the stiffness gradient along the sample height, and hence to the local relative density. These results demonstrate that a microstructural figure-of-merit, the effective relative density, can be used to quantify and predict the mechanical response.

Beauty and the beast: Aligning national curriculum standards with state (high school) graduation requirements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Linder-Scholer, B.

1994-12-31

An overview of SCI/MATH/MN - Minnesota`s standards-based, systemic approach to the reform and improvement of the K-12 science and mathematics education delivery system - is offered as an illustration of the challenges of aligning state educational practices with the national curriculum standards, and as a model for business involvement in state educational policy issues that will enable fundamental, across-the-system reform. SCI/MATH/MN illustrates the major challenges involved in developing a statewide vision for math and science education reform, articulating frameworks aligned with the national standards, building capacity for system-oriented change at the local level, and involving business in systemic reform.

Distributioin, orientation and scales of the field-aligned currents measured by Swarm

NASA Astrophysics Data System (ADS)

Yang, J.; Dunlop, M. W.

2016-12-01

We have statistically studied the R1, R2 and net field aligned currents using the FAC data of the Swarm satellites. We also have investigated the statistical, dual-spacecraft correlations of field-aligned current signatures between two Swarm spacecraft (A and C). For the first time we have inferred the orientations of the current sheets of FACs directly, using the maximum correlations, obtained from sliding data segments, which show clear trends in magnetic local time (MLT). To compare with this we also check the MVAB method. To explore the scale and variability of the current sheet supposition, we investigate the MLT dependence of the maximum correlations in different time shift or longitude shift bins.

'Googling' Gout: Exploring perceptions about gout through a linguistic analysis of online search activities.

PubMed

Jordan, Kayla N; Pennebaker, James W; Petrie, Keith J; Dalbeth, Nicola

2018-05-21

To understand what terms people seeking information about gout use most frequently in online searches and explore the psychological and emotional tone of these searches. A large de-identified dataset of search histories from major search engines was analyzed. Participants who searched for gout (n=1,117), arthritis (arthritis search control group, n=2,036, age and sex-matched), and a random set of age and sex-matched participants (general control group, n=2,150) were included. Searches were analyzed using Meaning Extraction Helper and Linguistic Inquiry and Word Count. The most frequent unique searches in the gout search group included gout-related and food-related terms. Those who searched for gout were most likely to search for words related to eating or avoidance. In contrast, those who searched for arthritis were more likely to search for disease or health-related words. Compared with the general control group, higher information seeking was observed for the gout and arthritis search groups. Compared with the general control group, both the gout and arthritis search groups searched for more food-related words, and fewer leisure and sexual words. The searches of both the gout and arthritis search groups were lower in positivity and higher in sadness words. The perception of gout as a condition managed by dietary strategies aligns with online information-seeking about the disease and its management. In contrast, people searching about arthritis focus more on medical strategies. Linguistic analyses reflect greater disability in social and leisure activities and lower positive emotion for those searching for gout or arthritis. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

Computational Search for Specific Magnetoelectronic Characteristics

NASA Astrophysics Data System (ADS)

Pickett, Warren E.

1997-08-01

Many aspects of the coupling between magnetic state (ferro- or antiferromagnetic) and the electronic properties of a material can be predicted reliably from local spin density (LSD) calculations. Such calculations are routinely used to interpret data, but so far little actual prediction of new materials has been attempted. We present here the application of LSD methods to look for half-metallic (HM) antiferromagnetic (AFM) compounds. These materials will have unusual properties, such as 100% spin-polarized transport with no net magnetic field, and the possibility of a novel type of superconductivity. The double perovskite crystal structure was chosen, due to some experience with it and its simplicity, and magnetic ions M',M'' were chosen in the expectation that their moments in the La_2M'M''O6 compound would be equal in magnitude and could be induced to align in an antiparallel manner, giving zero total magnetization. Results for six compounds, with magnetic ions chosen from the 3d transition series, will be described. Three HM AFM states have been found, as well as several HM ferromagnetic states.

Subtype analysis of Blastocystis sp. isolates from asymptomatic individuals in an urban community in the Philippines

PubMed

Adao, Davin Edric V.; Dela Serna, Ace O.; Belleza, Maria Luz B.; Bolo, Nicole R.; Rivera, Windell L.

2016-10-01

Blastocystis sp. is a commonly reported enteric protistan parasite in faecal specimens with a worldwide distribution afflicting both humans and a wide range of animals. The aim of this study is to characterize the subtypes (STs) of Blastocystis sp. isolates from asymptomatic individuals in an urban community in Pateros, Metro Manila, Philippines. The 600-bp small subunit ribosomal RNA (SSU rRNA) barcoding region of Blastocystis sp. isolates was amplified and sequenced using the primers RD5 and BhRDr. Subtypes were identified by uploading the sequences onto the Basic Local Alignment and Search Tool (BLAST) websites, the Blastocystis Subtype (18S) and Sequence Typing (MLST) Database and by construction of a phylogenetic tree. Twenty-nine (29) out of 35 individuals were detected positive for Blastocystis sp. ST3 is the most common among the three STs detected (65.5%), followed by ST1 (31.0%) and ST4 (3.44%). This study showed that DNA barcoding can serve as a helpful tool to investigate the diversity of Blastocystis sp. in the Philippines.

Nonprofit Hospitals’ Approach to Community Health Needs Assessment

PubMed Central

McLeroy, Kenneth R.; Burdine, James N.; Matarrita-Cascante, David

2015-01-01

Objectives. We sought a better understanding of how nonprofit hospitals are fulfilling the community health needs assessment (CHNA) provision of the 2010 Patient Protection and Affordable Care Act to conduct CHNAs and develop CHNA and implementation strategies reports. Methods. Through an Internet search of an estimated 179 nonprofit hospitals in Texas conducted between December 1, 2013, and January 5, 2014, we identified and reviewed 95 CHNA and implementation strategies reports. We evaluated and scored reports with specific criteria. We analyzed hospital-related and other report characteristics to understand relationships with report quality. Results. There was wide-ranging diversity in CHNA approaches and report quality. Consultant-led CHNA processes and collaboration with local health departments were associated with higher-quality reports. Conclusions. At the time of this study, the Internal Revenue Service had not yet issued the final regulations for the CHNA requirement. This provides an opportunity to strengthen the CHNA guidance for the final regulations, clarify the purpose of the assessment and planning process and reports, and better align assessment and planning activities through a public health framework. PMID:25602862

Screening of Lactobacillus isolates from gastrointestinal tract of guinea fowl for probiotic qualities using in vitro tests to select species-specific probiotic candidates.

PubMed

Vineetha, P G; Tomar, S; Saxena, V K; Susan, C; Sandeep, S; Adil, K; Mukesh, K

2016-08-01

A total of 32 Lactobacillus isolates, 8 each from the crop (LGFCP1-LGFCP8), proventriculus (LGFP9-LGFP16), ileum (LGFI17-LGFI24) and caeca (LGFCM25-LGFCM32) were isolated from 25 adult guinea fowl (Pearl variety), 22-28 weeks of age, and characterised morphologically, physiologically, biochemically and by molecular methods. Isolates were screened for their probiotic quality using range of in vitro tests: aggregation test, cell surface hydrophobicity, resistance to bile salts and acidic conditions, enzymatic tests and coaggregation and antagonistic test. Based on in vitro test results and a novel scoring method, the two best isolates were selected and partial 16S rRNA sequencing was done. BLAST (Basic Local Alignment Search Tool) analysis of sequence of isolate LGFCP4 showed 99% genetic identity with Lactobacillus plantarum and LGFP16 with Lactobacillus reuteri. The study shows that these two microbial agents may be suitable as potential probiotic candidates in guinea fowl, as well as in a feed supplement for other poultry species.

BIPAD: A web server for modeling bipartite sequence elements

PubMed Central

Bi, Chengpeng; Rogan, Peter K

2006-01-01

Background Many dimeric protein complexes bind cooperatively to families of bipartite nucleic acid sequence elements, which consist of pairs of conserved half-site sequences separated by intervening distances that vary among individual sites. Results We introduce the Bipad Server [1], a web interface to predict sequence elements embedded within unaligned sequences. Either a bipartite model, consisting of a pair of one-block position weight matrices (PWM's) with a gap distribution, or a single PWM matrix for contiguous single block motifs may be produced. The Bipad program performs multiple local alignment by entropy minimization and cyclic refinement using a stochastic greedy search strategy. The best models are refined by maximizing incremental information contents among a set of potential models with varying half site and gap lengths. Conclusion The web service generates information positional weight matrices, identifies binding site motifs, graphically represents the set of discovered elements as a sequence logo, and depicts the gap distribution as a histogram. Server performance was evaluated by generating a collection of bipartite models for distinct DNA binding proteins. PMID:16503993

Generation of non-genomic oligonucleotide tag sequences for RNA template-specific PCR

PubMed Central

Pinto, Fernando Lopes; Svensson, Håkan; Lindblad, Peter

2006-01-01

Background In order to overcome genomic DNA contamination in transcriptional studies, reverse template-specific polymerase chain reaction, a modification of reverse transcriptase polymerase chain reaction, is used. The possibility of using tags whose sequences are not found in the genome further improves reverse specific polymerase chain reaction experiments. Given the absence of software available to produce genome suitable tags, a simple tool to fulfill such need was developed. Results The program was developed in Perl, with separate use of the basic local alignment search tool, making the tool platform independent (known to run on Windows XP and Linux). In order to test the performance of the generated tags, several molecular experiments were performed. The results show that Tagenerator is capable of generating tags with good priming properties, which will deliberately not result in PCR amplification of genomic DNA. Conclusion The program Tagenerator is capable of generating tag sequences that combine genome absence with good priming properties for RT-PCR based experiments, circumventing the effects of genomic DNA contamination in an RNA sample. PMID:16820068

Contextual cost: when a visual-search target is not where it should be.

PubMed

Makovski, Tal; Jiang, Yuhong V

2010-02-01

Visual search is often facilitated when the search display occasionally repeats, revealing a contextual-cueing effect. According to the associative-learning account, contextual cueing arises from associating the display configuration with the target location. However, recent findings emphasizing the importance of local context near the target have given rise to the possibility that low-level repetition priming may account for the contextual-cueing effect. This study distinguishes associative learning from local repetition priming by testing whether search is directed toward a target's expected location, even when the target is relocated. After participants searched for a T among Ls in displays that repeated 24 times, they completed a transfer session where the target was relocated locally to a previously blank location (Experiment 1) or to an adjacent distractor location (Experiment 2). Results revealed that contextual cueing decreased as the target appeared farther away from its expected location, ultimately resulting in a contextual cost when the target swapped locations with a local distractor. We conclude that target predictability is a key factor in contextual cueing.

A synoptic study of the nature and effects of field aligned low energy electron precipitation in the auroral regions. Ph.D. Thesis - Catholic Univ. of America

NASA Technical Reports Server (NTRS)

Berko, F. W.

1972-01-01

A synoptic study is presented of field-aligned precipitation events observed during a 16-month period, representing a full 4 pi precession of the satellite orbital plane in magnetic local time. The morphology of this type of precipitation, its nature, and relationships between this phenomenon and other geophysical events are discussed in the context of the 16-month data base.

Mechanoresponsive, omni-directional and local matrix-degrading actin protrusions in human mesenchymal stem cells microencapsulated in a 3D collagen matrix.

PubMed

Ho, Fu Chak; Zhang, Wei; Li, Yuk Yin; Chan, Barbara Pui

2015-01-01

Cells are known to respond to multiple niche signals including extracellular matrix and mechanical loading. In others and our own studies, mechanical loading has been shown to induce the formation of cell alignment in 3D collagen matrix with random meshwork, challenging our traditional understanding on the necessity of having aligned substrates as the prerequisite of alignment formation. This motivates our adventure in deciphering the mechanism of loading-induced cell alignment and hence the discovery of the novel protrusive functional structure at the cell-matrix interface. Here we report the formation of mechanoresponsive, omni-directional and local matrix-degrading actin protrusions in human mesenchymal stem cells (hMSCs) microencapsulated in collagen following a shifted actin assembly/disassembly balance. These actin protrusive structures exhibit morphological and compositional similarity to filopodia and invadopodia but differ from them in stability, abundance, signaling and function. Without ruling out the possibility that these structures may comprise special subsets of filopodia and invadopodia, we propose to name them as mechanopodia so as to reveal their mechano-inductive mechanism. We also suggest that more intensive investigations are needed to delineate the functional significance and physiological relevance of these structures. This work identifies a brand new target for cell-matrix interaction and mechanoregulation studies. Copyright © 2015 Elsevier Ltd. All rights reserved.

ALDB: a domestic-animal long noncoding RNA database.

PubMed

Li, Aimin; Zhang, Junying; Zhou, Zhongyin; Wang, Lei; Liu, Yujuan; Liu, Yajun

2015-01-01

Long noncoding RNAs (lncRNAs) have attracted significant attention in recent years due to their important roles in many biological processes. Domestic animals constitute a unique resource for understanding the genetic basis of phenotypic variation and are ideal models relevant to diverse areas of biomedical research. With improving sequencing technologies, numerous domestic-animal lncRNAs are now available. Thus, there is an immediate need for a database resource that can assist researchers to store, organize, analyze and visualize domestic-animal lncRNAs. The domestic-animal lncRNA database, named ALDB, is the first comprehensive database with a focus on the domestic-animal lncRNAs. It currently archives 12,103 pig intergenic lncRNAs (lincRNAs), 8,923 chicken lincRNAs and 8,250 cow lincRNAs. In addition to the annotations of lincRNAs, it offers related data that is not available yet in existing lncRNA databases (lncRNAdb and NONCODE), such as genome-wide expression profiles and animal quantitative trait loci (QTLs) of domestic animals. Moreover, a collection of interfaces and applications, such as the Basic Local Alignment Search Tool (BLAST), the Generic Genome Browser (GBrowse) and flexible search functionalities, are available to help users effectively explore, analyze and download data related to domestic-animal lncRNAs. ALDB enables the exploration and comparative analysis of lncRNAs in domestic animals. A user-friendly web interface, integrated information and tools make it valuable to researchers in their studies. ALDB is freely available from http://res.xaut.edu.cn/aldb/index.jsp.

Analysis of resistance genes of clinical Pannonibacter phragmitetus strain 31801 by complete genome sequencing.

PubMed

Ming, De-Song; Chen, Qing-Qing; Chen, Xiao-Tin

2018-05-14

To clarify the resistance mechanisms of Pannonibacter phragmitetus 31801, isolated from the blood of a liver abscess patient, at the genomic level, we performed whole genomic sequencing using a PacBio RS II single-molecule real-time long-read sequencer. Bioinformatic analysis of the resulting sequence was then carried out to identify any possible resistance genes. Analyses included Basic Local Alignment Search Tool searches against the Antibiotic Resistance Genes Database, ResFinder analysis of the genome sequence, and Resistance Gene Identifier analysis within the Comprehensive Antibiotic Resistance Database. Prophages, clustered regularly interspaced short palindromic repeats (CRISPR), and other putative virulence factors were also identified using PHAST, CRISPRfinder, and the Virulence Factors Database, respectively. The circular chromosome and single plasmid of P. phragmitetus 31801 contained multiple antibiotic resistance genes, including those coding for three different types of β-lactamase [NPS β-lactamase (EC 3.5.2.6), β-lactamase class C, and a metal-dependent hydrolase of β-lactamase superfamily I]. In addition, genes coding for subunits of several multidrug-resistance efflux pumps were identified, including those targeting macrolides (adeJ, cmeB), tetracycline (acrB, adeAB), fluoroquinolones (acrF, ceoB), and aminoglycosides (acrD, amrB, ceoB, mexY, smeB). However, apart from the tripartite macrolide efflux pump macAB-tolC, the genome did not appear to contain the complete complement of subunit genes required for production of most of the major multidrug-resistance efflux pumps.

Effectiveness of a cloning and sequencing exercise on student learning with subsequent publication in the National Center for Biotechnology Information GenBank.

PubMed

Lau, Joann M; Robinson, David L

2009-01-01

With rapid advances in biotechnology and molecular biology, instructors are challenged to not only provide undergraduate students with hands-on experiences in these disciplines but also to engage them in the "real-world" scientific process. Two common topics covered in biotechnology or molecular biology courses are gene-cloning and bioinformatics, but to provide students with a continuous laboratory-based research experience in these techniques is difficult. To meet these challenges, we have partnered with Bio-Rad Laboratories in the development of the "Cloning and Sequencing Explorer Series," which combines wet-lab experiences (e.g., DNA extraction, polymerase chain reaction, ligation, transformation, and restriction digestion) with bioinformatics analysis (e.g., evaluation of DNA sequence quality, sequence editing, Basic Local Alignment Search Tool searches, contig construction, intron identification, and six-frame translation) to produce a sequence publishable in the National Center for Biotechnology Information GenBank. This 6- to 8-wk project-based exercise focuses on a pivotal gene of glycolysis (glyceraldehyde-3-phosphate dehydrogenase), in which students isolate, sequence, and characterize the gene from a plant species or cultivar not yet published in GenBank. Student achievement was evaluated using pre-, mid-, and final-test assessments, as well as with a survey to assess student perceptions. Student confidence with basic laboratory techniques and knowledge of bioinformatics tools were significantly increased upon completion of this hands-on exercise.

Integrating alignment-based and alignment-free sequence similarity measures for biological sequence classification.

PubMed

Borozan, Ivan; Watt, Stuart; Ferretti, Vincent

2015-05-01

Alignment-based sequence similarity searches, while accurate for some type of sequences, can produce incorrect results when used on more divergent but functionally related sequences that have undergone the sequence rearrangements observed in many bacterial and viral genomes. Here, we propose a classification model that exploits the complementary nature of alignment-based and alignment-free similarity measures with the aim to improve the accuracy with which DNA and protein sequences are characterized. Our model classifies sequences using a combined sequence similarity score calculated by adaptively weighting the contribution of different sequence similarity measures. Weights are determined independently for each sequence in the test set and reflect the discriminatory ability of individual similarity measures in the training set. Because the similarity between some sequences is determined more accurately with one type of measure rather than another, our classifier allows different sets of weights to be associated with different sequences. Using five different similarity measures, we show that our model significantly improves the classification accuracy over the current composition- and alignment-based models, when predicting the taxonomic lineage for both short viral sequence fragments and complete viral sequences. We also show that our model can be used effectively for the classification of reads from a real metagenome dataset as well as protein sequences. All the datasets and the code used in this study are freely available at https://collaborators.oicr.on.ca/vferretti/borozan_csss/csss.html. ivan.borozan@gmail.com Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press.

Integrating alignment-based and alignment-free sequence similarity measures for biological sequence classification

PubMed Central

Borozan, Ivan; Watt, Stuart; Ferretti, Vincent

2015-01-01

Motivation: Alignment-based sequence similarity searches, while accurate for some type of sequences, can produce incorrect results when used on more divergent but functionally related sequences that have undergone the sequence rearrangements observed in many bacterial and viral genomes. Here, we propose a classification model that exploits the complementary nature of alignment-based and alignment-free similarity measures with the aim to improve the accuracy with which DNA and protein sequences are characterized. Results: Our model classifies sequences using a combined sequence similarity score calculated by adaptively weighting the contribution of different sequence similarity measures. Weights are determined independently for each sequence in the test set and reflect the discriminatory ability of individual similarity measures in the training set. Because the similarity between some sequences is determined more accurately with one type of measure rather than another, our classifier allows different sets of weights to be associated with different sequences. Using five different similarity measures, we show that our model significantly improves the classification accuracy over the current composition- and alignment-based models, when predicting the taxonomic lineage for both short viral sequence fragments and complete viral sequences. We also show that our model can be used effectively for the classification of reads from a real metagenome dataset as well as protein sequences. Availability and implementation: All the datasets and the code used in this study are freely available at https://collaborators.oicr.on.ca/vferretti/borozan_csss/csss.html. Contact: ivan.borozan@gmail.com Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25573913

The Generation of the Distant Kuiper Belt by Planet Nine from an Initially Broad Perihelion Distribution

NASA Astrophysics Data System (ADS)

Khain, Tali; Batygin, Konstantin; Brown, Michael E.

2018-06-01

The observation that the orbits of long-period Kuiper Belt objects (KBOs) are anomalously clustered in physical space has recently prompted the Planet Nine hypothesis—the proposed existence of a distant and eccentric planetary member of our solar system. Within the framework of this model, a Neptune-like perturber sculpts the orbital distribution of distant KBOs through a complex interplay of resonant and secular effects, such that in addition to perihelion-circulating objects, the surviving orbits get organized into apsidally aligned and anti-aligned configurations with respect to Planet Nine’s orbit. In this work, we investigate the role of Kuiper Belt initial conditions on the evolution of the outer solar system using numerical simulations. Intriguingly, we find that the final perihelion distance distribution depends strongly on the primordial state of the system, and we demonstrate that a bimodal structure corresponding to the existence of both aligned and anti-aligned clusters is only reproduced if the initial perihelion distribution is assumed to extend well beyond ∼36 au. The bimodality in the final perihelion distance distribution is due to the existence of permanently stable objects, with the lower perihelion peak corresponding to the anti-aligned orbits and the higher perihelion peak corresponding to the aligned orbits. We identify the mechanisms that enable the persistent stability of these objects and locate the regions of phase space in which they reside. The obtained results contextualize the Planet Nine hypothesis within the broader narrative of solar system formation and offer further insight into the observational search for Planet Nine.

Paraplegic patients: how to measure balance and what is normal or functional?

PubMed

Barkoh, Kaku; Lucas, Joshua W; Lee, Larry; Hsieh, Patrick C; Wang, Jeffrey C; Rolfe, Kevin

2018-02-01

To review the current understanding and data of sagittal balance and alignment considerations in paraplegic patients. A PubMed literature search was conducted to identify all relevant articles relating to sagittal alignment and sagittal balance considerations in paraplegic and spinal cord injury patients. While there are numerous studies and publications on sagittal balance in the ambulatory patient with spinal deformity or complex spine disorders, there is paucity of the literature on "normal" sagittal balance in the paraplegic patients. Studies have reported significantly alterations of the sagittal alignment parameters in the non-ambulatory paraplegic patients compared to ambulatory patients. The variability of the alignment changes is related to the differences in the level of the spinal cord injury and their differences in the activations of truncal muscles to allow functional movements in those patients, particularly in optimizing sitting and transferring. Surgical goal in treating paraplegic patients with complex pathologies should not be solely directed to achieve the "normal" radiographic parameters of sagittal alignment in the ambulatory patients. The goal should be to maintain good coronal balance to allow ideal sitting position and to preserve motion segment to optimize functions of paraplegia patients. Current available literature data have not defined normal sagittal parameters for paraplegic patients. There are significant differences in postural sagittal parameters and muscle activations in paraplegic and non-spinal cord injury patients that can lead to differences in sagittal alignment and balance. Treatment goal in spine surgery for paraplegic patients should address their global function, sitting balance, and ability to perform self-care rather than the accepted radiographic parameters for adult spinal deformity in ambulatory patients.

Botulinum toxin for the treatment of strabismus.

PubMed

Rowe, Fiona J; Noonan, Carmel P

2017-03-02

The use of botulinum toxin as an investigative and treatment modality for strabismus is well reported in the medical literature. However, it is unclear how effective it is in comparison to other treatment options for strabismus. The primary objective was to examine the efficacy of botulinum toxin therapy in the treatment of strabismus compared with alternative conservative or surgical treatment options. This review sought to ascertain those types of strabismus that particularly benefit from the use of botulinum toxin as a treatment option (such as small angle strabismus or strabismus with binocular potential, i.e. the potential to use both eyes together as a pair). The secondary objectives were to investigate the dose effect and complication rates associated with botulinum toxin. We searched CENTRAL (which contains the Cochrane Eyes and Vision Trials Register) (2016, Issue 6), Ovid MEDLINE, Ovid MEDLINE In-Process and Other Non-Indexed Citations, Ovid MEDLINE Daily, Ovid OLDMEDLINE (January 1946 to July 2016), Embase (January 1980 to July 2016), Latin American and Caribbean Literature on Health Sciences (LILACS) (January 1982 to July 2016), the ISRCTN registry (www.isrctn.com/editAdvancedSearch), ClinicalTrials.gov (www.clinicaltrials.gov), and the World Health Organization (WHO) International Clinical Trials Registry Platform (ICTRP) (www.who.int/ictrp/search/en). We did not use any date or language restrictions in the electronic searches for trials. We last searched the electronic databases on 11 July 2016. We handsearched the British and Irish Orthoptic Journal, Australian Orthoptic Journal, proceedings of the European Strabismological Association (ESA), International Strabismological Association (ISA) and International Orthoptic Association (IOA) (www.liv.ac.uk/orthoptics/research/search.htm) and American Academy of Paediatric Ophthalmology and Strabismus meetings (AAPOS). We contacted researchers who are active in this field for information about further published or unpublished studies. We included randomised controlled trials (RCTS) of any use of botulinum toxin treatment for strabismus. Two review authors independently selected studies and extracted data. We used standard methods expected by Cochrane and assessed the certainty of the evidence using GRADE. We defined ocular alignment as an angle of deviation of less than or equal to 10 prism dioptres. Six RCTs were eligible for inclusion. We judged the included studies as at a mixture of low, unclear and high risk of bias. We did not consider any of the included studies as at low risk of bias for all domains.Two trials conducted in Spain (102 people, number of eyes not specified) compared botulinum toxin with surgery in children that required retreatment for acquired or infantile esotropia. These two studies provided low-certainty evidence that children who received botulinum toxin may have a similar or slightly reduced chance of achieving ocular alignment (pooled risk ratio (RR) 0.91, 95% confidence interval (CI) 0.71 to 1.16), binocular single vision (RR 0.88, 95% CI 0.63 to 1.23), sensory fusion (RR 0.88, 95% CI 0.63 to 1.23) and stereopsis (RR 0.86, 95% CI 0.59 to 1.25) compared with children who received surgery. One trial from Canada compared botulinum toxin with surgery in 30 adults (30 eyes) with horizontal strabismus and reported a reduced chance of ocular alignment with botulinum toxin (RR 0.38, 95% CI 0.17 to 0.85; low-certainty evidence).One trial in the UK suggested that botulinum toxin may result in a similar or slightly improved chance of ocular alignment in people with acute onset sixth nerve palsy compared with observation (RR 1.19, 95% CI 0.96 to 1.48; 47 participants, low-certainty evidence).Very low-certainty evidence from one trial from Brazil suggested that adjuvant botulinum toxin in strabismus surgery may increase the chances of ocular alignment compared with strabismus surgery alone (RR 1.83, 95% CI 0.41 to 8.11; 23 participants).One trial from China of 47 participants (94 eyes) suggested that people receiving botulinum toxin combined with sodium hyaluronate may have a similar or slightly reduced chance of achieving ocular alignment compared with botulinum toxin alone (RR 0.81, 95% CI 0.36 to 1.82; low-certainty evidence).Reported complications in people given botulinum toxin in the included trials included ptosis (range 9% to 41.66%) and vertical deviation (range 8.3% to 18.51%). Ptosis occurred less frequently when treated with botulinum toxin combined with sodium hyaluronate compared to botulinum toxin alone. Most published literature on the use of botulinum toxin in the treatment of strabismus consists of retrospective studies, cohort studies or case reviews. Although these provide useful descriptive information, clarification is required as to the effective use of botulinum toxin as an independent treatment modality. Six RCTs on the therapeutic use of botulinum toxin in strabismus, graded as low and very low-certainty evidence, have shown varying responses. These include a lack of evidence for effect of botulinum toxin on reducing visual symptoms in acute sixth nerve palsy, poor response in people with horizontal strabismus without binocular vision, similar or slightly reduced achievement of successful ocular alignment in children with esotropia and potential increased achievement of successful ocular alignment where surgery and botulinum toxin are combined. Further high quality trials using robust methodologies are required to compare the clinical and cost effectiveness of various forms of botulinum toxin (e.g. Dysport, Xeomin, etc), to compare botulinum toxin with and without adjuvant solutions and to compare botulinum toxin to alternative surgical interventions in strabismus cases with and without potential for binocular vision.

Zipping, entanglement, and the elastic modulus of aligned single-walled carbon nanotube films

PubMed Central

Won, Yoonjin; Gao, Yuan; Panzer, Matthew A.; Xiang, Rong; Maruyama, Shigeo; Kenny, Thomas W.; Cai, Wei; Goodson, Kenneth E.

2013-01-01

Reliably routing heat to and from conversion materials is a daunting challenge for a variety of innovative energy technologies––from thermal solar to automotive waste heat recovery systems––whose efficiencies degrade due to massive thermomechanical stresses at interfaces. This problem may soon be addressed by adhesives based on vertically aligned carbon nanotubes, which promise the revolutionary combination of high through-plane thermal conductivity and vanishing in-plane mechanical stiffness. Here, we report the data for the in-plane modulus of aligned single-walled carbon nanotube films using a microfabricated resonator method. Molecular simulations and electron microscopy identify the nanoscale mechanisms responsible for this property. The zipping and unzipping of adjacent nanotubes and the degree of alignment and entanglement are shown to govern the spatially varying local modulus, thereby providing the route to engineered materials with outstanding combinations of mechanical and thermal properties. PMID:24309375

Photonic Sorting of Aligned, Crystalline Carbon Nanotube Textiles.

PubMed

Bulmer, John S; Gspann, Thurid S; Orozco, Francisco; Sparkes, Martin; Koerner, Hilmar; Di Bernardo, A; Niemiec, Arkadiusz; Robinson, J W A; Koziol, Krzysztof K; Elliott, James A; O'Neill, William

2017-10-11

Floating catalyst chemical vapor deposition uniquely generates aligned carbon nanotube (CNT) textiles with individual CNT lengths magnitudes longer than competing processes, though hindered by impurities and intrinsic/extrinsic defects. We present a photonic-based post-process, particularly suited for these textiles, that selectively removes defective CNTs and other carbons not forming a threshold thermal pathway. In this method, a large diameter laser beam rasters across the surface of a partly aligned CNT textile in air, suspended from its ends. This results in brilliant, localized oxidation, where remaining material is an optically transparent film comprised of few-walled CNTs with profound and unique improvement in microstructure alignment and crystallinity. Raman spectroscopy shows substantial D peak suppression while preserving radial breathing modes. This increases the undoped, specific electrical conductivity at least an order of magnitude to beyond that of single-crystal graphite. Cryogenic conductivity measurements indicate intrinsic transport enhancement, opposed to simply removing nonconductive carbons/residual catalyst.

Self aligned hysteresis free carbon nanotube field-effect transistors

NASA Astrophysics Data System (ADS)

Shlafman, M.; Tabachnik, T.; Shtempluk, O.; Razin, A.; Kochetkov, V.; Yaish, Y. E.

2016-04-01

Hysteresis phenomenon in the transfer characteristics of carbon nanotube field effect transistor (CNT FET) is being considered as the main obstacle for successful realization of electronic devices based on CNTs. In this study, we prepare four kinds of CNTFETs and explore their hysteretic behavior. Two kinds of devices comprise on-surface CNTs (type I) and suspended CNTs (type II) with thin insulating layer underneath and a single global gate which modulates the CNT conductance. The third and fourth types (types III and IV) consist of suspended CNT over a metallic local gate underneath, where for type IV the local gate was patterned self aligned with the source and drain electrodes. The first two types of devices, i.e., type I and II, exhibit substantial hysteresis which increases with scanning range and sweeping time. Under high vacuum conditions and moderate electric fields ( |E |>4 ×106 V /cm ), the hysteresis for on-surface devices cannot be eliminated, as opposed to suspended devices. Interestingly, type IV devices exhibit no hysteresis at all at ambient conditions, and from the different roles which the global and local gates play for the four types of devices, we could learn about the hysteresis mechanism of this system. We believe that these self aligned hysteresis free FETs will enable the realization of different electronic devices and sensors based on CNTs.

Molecular Identification of Commercialized Medicinal Plants in Southern Morocco

PubMed Central

Krüger, Åsa; Rydberg, Anders; Abbad, Abdelaziz; Björk, Lars; Martin, Gary

2012-01-01

Background Medicinal plant trade is important for local livelihoods. However, many medicinal plants are difficult to identify when they are sold as roots, powders or bark. DNA barcoding involves using a short, agreed-upon region of a genome as a unique identifier for species– ideally, as a global standard. Research Question What is the functionality, efficacy and accuracy of the use of barcoding for identifying root material, using medicinal plant roots sold by herbalists in Marrakech, Morocco, as a test dataset. Methodology In total, 111 root samples were sequenced for four proposed barcode regions rpoC1, psbA-trnH, matK and ITS. Sequences were searched against a tailored reference database of Moroccan medicinal plants and their closest relatives using BLAST and Blastclust, and through inference of RAxML phylograms of the aligned market and reference samples. Principal Findings Sequencing success was high for rpoC1, psbA-trnH, and ITS, but low for matK. Searches using rpoC1 alone resulted in a number of ambiguous identifications, indicating insufficient DNA variation for accurate species-level identification. Combining rpoC1, psbA-trnH and ITS allowed the majority of the market samples to be identified to genus level. For a minority of the market samples, the barcoding identification differed significantly from previous hypotheses based on the vernacular names. Conclusions/Significance Endemic plant species are commercialized in Marrakech. Adulteration is common and this may indicate that the products are becoming locally endangered. Nevertheless the majority of the traded roots belong to species that are common and not known to be endangered. A significant conclusion from our results is that unknown samples are more difficult to identify than earlier suggested, especially if the reference sequences were obtained from different populations. A global barcoding database should therefore contain sequences from different populations of the same species to assure the reference sequences characterize the species throughout its distributional range. PMID:22761800

A Search for Signatures of Ion Acoustic Shoulders in the SERSIO sounding rocket data set

NASA Astrophysics Data System (ADS)

Ellis, A. T.; Lessard, M. R.; Kintner, P. M.; Lynch, K. A.; Klatt, E.; Oksavik, K.

2004-12-01

Although first predicted in the early 1960's, enhanced Ion Acoustic Shoulders have only been observed by incoherent scatter radars since the late 1980's. The signature of an IAS is seen as a positive and negative frequency shift about the center radar frequency. These features occur at altitudes of 150 to over 600 km, peaking at 500 km, with spatial extent (perpendicular to the magnetic field) the order of 10 km. The occurrence distribution shows a maximum in the pre-midnight region, with a secondary peak on the dayside (Rietveld et al 1995). Observations of strong (1000 mA/m2), localized currents by EISCAT have led to theories based on current-driven instabilities as the source of these waves (Forme, 1993; St.-Maurice et al., 1996). The SERSIO (Svalbard EISCAT Rocket Study of Ion Outflows) sounding rocket mission was launched into CME-driven dayside aurora on the 22nd of January 2004 at 0857 UT (0436 MLT) from Ny-Alesund (78o 55' 11" N, 11o 56' 60" E) and reached an apogee of 782 km. During the flight, the EISCAT incoherent scatter radar network supported the mission by monitoring altitude profiles of electron and ion density, velocity and temperature. From Longyearbyen, located approximately 50 km south east of Ny-Alesund and near the trajectory of SERSIO, the 32m ESR dish was tracking the ionospheric footprint of the payload while the 42 m dish was making local field-aligned measurements. The data from these radars clearly indicated the presence of enhanced ion acoustic shoulders, suggesting that SERSIO flew through a 'field' of Ion Acoustic Shoulders. In fact, the plasma wave environment observed by SERSIO was composed of traditional VLF hiss and Broad Band ELF hiss with wavelengths less than the order of 6m. Here we present the result of our search for Ion Acoustic Shoulders in the SERSIO data set.

Linear clusters of galaxies - A194

NASA Technical Reports Server (NTRS)

Chapman, G. N. F.; Geller, M. J.; Huchra, J. P.

1988-01-01

New measurements for 160 redshifts and previous measurements for 108 other redshifts are presented for galaxies within 5 deg of A194. The galaxy distribution in A194 is shown to be inconsistent with a spherically symmetric King model. A mass-to-light ratio is derived using the virial theorem which is lower than the mean for the groups in the CfA redshift survey (Huchra and Geller, 1982; Geller, 1984). A nonparametric test for galaxy-cluster alignment and a Chi-squared test are used to search for alignment of galaxy major axes with the axis of A194. Evidence for neither luminosity segregation nor significant differences in the velocity or surface distributions of galaxies as a function of morphological type is found.

Freiburg RNA tools: a central online resource for RNA-focused research and teaching.

PubMed

Raden, Martin; Ali, Syed M; Alkhnbashi, Omer S; Busch, Anke; Costa, Fabrizio; Davis, Jason A; Eggenhofer, Florian; Gelhausen, Rick; Georg, Jens; Heyne, Steffen; Hiller, Michael; Kundu, Kousik; Kleinkauf, Robert; Lott, Steffen C; Mohamed, Mostafa M; Mattheis, Alexander; Miladi, Milad; Richter, Andreas S; Will, Sebastian; Wolff, Joachim; Wright, Patrick R; Backofen, Rolf

2018-05-21

The Freiburg RNA tools webserver is a well established online resource for RNA-focused research. It provides a unified user interface and comprehensive result visualization for efficient command line tools. The webserver includes RNA-RNA interaction prediction (IntaRNA, CopraRNA, metaMIR), sRNA homology search (GLASSgo), sequence-structure alignments (LocARNA, MARNA, CARNA, ExpaRNA), CRISPR repeat classification (CRISPRmap), sequence design (antaRNA, INFO-RNA, SECISDesign), structure aberration evaluation of point mutations (RaSE), and RNA/protein-family models visualization (CMV), and other methods. Open education resources offer interactive visualizations of RNA structure and RNA-RNA interaction prediction as well as basic and advanced sequence alignment algorithms. The services are freely available at http://rna.informatik.uni-freiburg.de.