• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 335
Next 10 →

The program dependence graph and its use in optimization

by Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren - ACM Transactions on Programming Languages and Systems , 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract - Cited by 996 (3 self) - Add to MetaCart
and data dependences. Program transformations that require interaction of the two dependence types can also be easily handled with our representation. As an example, an incremental approach to modifying data dependences resulting from branch deletion or loop unrolling is intro-duced. The PDG supports

The Effect of Insertions, Deletions, and Alignment Errors on the Branch-Site Test of Positive Selection

by William Fletcher, Ziheng Yang
"... The detection of positive Darwinian selection affecting protein-coding genes remains a topic of great interest and importance. The ‘‘branch-site’ ’ test is designed to detect localized episodic bouts of positive selection that affect only a few amino acid residues on particular lineages and has been ..."
Abstract - Cited by 42 (2 self) - Add to MetaCart
to analyze divergent sequences, the impact of indels and alignment errors is a major concern. Here, we used a recently developed indelsimulation program to examine the false-positive rate and power of the branch-site test. We find that insertions and deletions do not cause excessive false positives

Fast branching algorithm for cluster vertex deletion

by Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk - CoRR
"... ar ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract not found

and Accounts Receivable Branch

by unknown authors
"... TRAINING: No special training requirements have been identified for any documents issued with this change notice. REMARKS: IMC 2800 (Materials Inspection Program) is revised to reflect changes due to additions, deletions, and revisions for the following: The enforcement Policy Policy & Guidance ..."
Abstract - Add to MetaCart
TRAINING: No special training requirements have been identified for any documents issued with this change notice. REMARKS: IMC 2800 (Materials Inspection Program) is revised to reflect changes due to additions, deletions, and revisions for the following: The enforcement Policy Policy & Guidance

Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes?

by James Nastos, Yong Gao
"... Abstract. Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case anal-ysis. We introduce a novel and general search strategy that branches on the forbidden subg ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case anal-ysis. We introduce a novel and general search strategy that branches on the forbidden

Multiple Genome Rearrangement and Breakpoint Phylogeny

by David Sankoff, Mathieu Blanchette , 1998
"... Multiple alignment of macromolecular sequences generalizes from N = 2 to N # 3 the comparison of N sequences which have diverged through the local processes of insertion, deletion and substitution. Gene-order sequences diverge through non-local genome rearrangement processes such as inversion ..."
Abstract - Cited by 103 (16 self) - Add to MetaCart
Multiple alignment of macromolecular sequences generalizes from N = 2 to N # 3 the comparison of N sequences which have diverged through the local processes of insertion, deletion and substitution. Gene-order sequences diverge through non-local genome rearrangement processes such as inversion

Evolving the Architecture of a Multi-Part Program in Genetic Programming . . .

by John R. Koza - EVOLUTIONARY PROGRAMMING IV: PROCEEDINGS OF THE FOURTH ANNUAL CONFERENCE ON EVOLUTIONARY PROGRAMMING , 1995
"... This paper describes six new architecture-altering operations that provide a way to dynamically determine the architecture of a multipart program during a run of genetic programming. The new operations are patterned after the naturally occurring operations of gene duplication and gene deletion and a ..."
Abstract - Cited by 24 (18 self) - Add to MetaCart
and are motivated by Ohno's provocative book Evolution by Means of Gene Duplication. The new operations are branch duplication, argument duplication, branch creation, argument creation, branch deletion, and argument deletion. These operations dynamically change the architecture of various programs during a run

N-Glycan branching requirement in neuronal and postnatal viability

by Zhengyi Ye, Jamey D. Marth - Glycobiology , 2004
"... The structural variations among extracellular N-glycans reflect the activity of glycosyltransferases and glycosidases that operate in the Golgi apparatus. More than other types of vertebrate glycans, N-glycans are highly branched oligo-saccharides with multiple antennae linked to an underlying manno ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
, and early postnatal death. Unexpectedly, neuronal Mgat2 deletion resulting in the loss of complex but not hybrid N-glycan branching was well tolerated without phenotypic markers of neuronal or locomotor dysfunction. Structural features asso-ciated with hybrid N-glycan branching comprise a requisite

THE CENTROIDAL BRANCHES OF A SEPARABLE GRAPH ARE EDGE RECONSTRUCTIBLE

by Robert Molina
"... If T is a tree, then the weight of a vertex v in T is the number of vertices in a largest component of T − v. The centroid of a tree is the set of vertices of minimum weight. We show that if G is a separable graph then there is a unique block or cutvertex that contains the centroids of all spanning ..."
Abstract - Add to MetaCart
trees of G. We define this block or cutvertex to be the centroid of G. We show that the centroid and rooted branches of the centroid are edge reconstructible, that is, determined up to isomorphism by the set of edge deleted subgraphs.

Polymorphic insertions and deletions in parabasalian enolase genes

by Patrick J Keeling
"... Abstract. Insertions and deletions in gene sequences have been used as characters to infer phylogenetic relationships and, like any character, the information they contain varies in utility between different levels of evolution. In one case, the absence of two otherwise highly conserved deletions i ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
of this character within the parabasalia. Parabasalian homologues were found to be polymorphic for these deletions, and the phylogeny of parabasalian enolases shows that the deletion-possessing genes branch within deletion-lacking genes (i.e., they did not form two clearly distinct groups). Phylogenetic
Next 10 →
Results 1 - 10 of 335
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University