Filters








264,161 Hits in 4.7 sec

Deletion to Induced Matching [article]

Akash Kumar, Mithilesh Kumar
2020 arXiv   pre-print
In the DELETION TO INDUCED MATCHING problem, we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V(G) such that |S|≤ k and the  ...  In this paper, we provide a fixed-parameter tractable (FPT) algorithm of running time O^*(1.748^k) for the DELETION TO INDUCED MATCHING problem using branch-and-reduce strategy and path decomposition.  ...  to Induced Matching In this section, we would provide the fixed parameter tractable algorithm for DELETION TO INDUCED MATCHING.  ... 
arXiv:2008.09660v2 fatcat:d4y4wakvrnbbdcm2tq5oa7kemu

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2010 Algorithmica  
Further, while studying the parameterized complexity of the problem of deleting k vertices to obtain a König-Egerváry graph, we show a number of interesting structural results on matchings and vertex covers  ...  2. does there exist a set of k vertices (edges) that induce a König-Egerváry subgraph?  ...  It is NP-hard to approximate König Edge Deletion to within 2.88. is W [1]-hard. The Edge Induced König Subgraph problem is FPT and we conjecture that König Edge Deletion is W [1]-hard.  ... 
doi:10.1007/s00453-010-9412-2 fatcat:lykslhuxpjavvpplwhov2b6neq

Group Connectivity Of 1-Edge Deletable Im-Extendable Graphs

Keke Wang, Rongxia Hao, Jianbing Liu
2011 Zenodo  
These have been extended by Jaeger, Linial, Payan and Tarsil in 1992 to group connectivity, the generalized form of nowhere-zero flows.  ...  In 1950s, Tutte introduced the theory of nowhere-zero flows as a tool to investigate the coloring problem of maps, together with his most fascinating conjectures on nowhere-zero flows.  ...  Otherwise, let M = {v 2 v 4 } be an induced matching of G − {v 1 v 2 }, it extended to a perfect matching {v 2 v 4 , v 3 v 5 , v 6 v 1 }. Case2 Deleting one edge in E 2 .  ... 
doi:10.5281/zenodo.814410 fatcat:umxc5klvazfcrn6na6phf46v3i

New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition

Qilong Feng, Guanlan Tan, Senmin Zhu, Bin Fu, Jianxin Wang, Michael Wagner
2018 International Symposium on Algorithms and Computation  
To the best of our knowledge, this paper is the first one establishing the connection between Gallai-Edmonds decomposition and König-Egerváry graphs.  ...  By exploiting the classical Gallai-Edmonds decomposition, we establish connections between minimum vertex cover, Gallai-Edmonds decomposition structure, maximum matching, maximum bisection, and König-Egerváry  ...  The Edge Induced König Subgraph problem is closely related to a graph modification problem, called König Edge Deletion problem, which is to delete at most k edges to turn a given graph into a König graph  ... 
doi:10.4230/lipics.isaac.2018.31 dblp:conf/isaac/FengTZFW18 fatcat:iuwlebsdzjgxzmibtuvflpzuy4

FOXO1 Mediates RANKL-Induced Osteoclast Formation and Activity

Yu Wang, Guangyu Dong, Hyeran Helen Jeon, Mohamad Elazizi, Lan B. La, Alhassan Hameedaldeen, E Xiao, Chen Tian, Sarah Alsadun, Yongwon Choi, Dana T. Graves
2015 Journal of Immunology  
Loss of FOXO1 leads to reduced osteoclast formation and activity in vitro BMMs from FOXO1 deleted or matched control mice were stimulated with RANKL in vitro to induce osteoclastogenesis (Fig. 3A, Supplemental  ...  M-CSF induced a dose-dependent 16fold increase in BMM migration. This increase was reduced by up to 72% when FOXO1 was deleted (p , 0.05) (Fig. 7D) .  ... 
doi:10.4049/jimmunol.1402211 pmid:25694609 pmcid:PMC4355282 fatcat:arckn5422zhdlfpszlyzlqq4fu

Edge-deletable IM-extendable graphs with minimum number of edges

Xiumei Wang, Jinjiang Yuan, Sujing Zhou
2009 Discrete Mathematics  
A graph G is induced matching extendable, shortly IM-extendable, if every induced matching of G is included in a perfect matching of G.  ...  = 4r − 2 for some integer r ≥ 3 and G ∼ = C 5 [N 2r ], where N 2r is the empty graph on 2r vertices and C 5 [N 2r ] is the graph obtained from C 5 by replacing each vertex with a graph isomorphic to N  ...  Acknowledgement We are grateful to two referees for many helpful suggestions.  ... 
doi:10.1016/j.disc.2009.03.048 fatcat:nu5mgzsgmfan3lhqnlt436xpbe

Fractional matching preclusion for butterfly derived networks

Xia Wang, Tianlong Ma, Chengfu Ye, Yuzhi Xiao, Fang Wang
2019 Theory and Applications of Graphs  
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.  ...  The fractional matching preclusion number (FMP number) of G, denoted by f mp(G), is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching.  ...  We would like to thank the anonymous referees for a number of helpful comments and suggestions.  ... 
doi:10.20429/tag.2019.060103 fatcat:ifbgs3ggfjfi7jrc6qmojxgaei

Functional consequences of mitochondrial DNA deletions in human skin fibroblasts: increased contractile strength in collagen lattices is due to oxidative stress-induced lysyl oxidase activity

M Majora, T Wittkampf, BA Schuermann, M Schneider, P Schroeder, J Krutmann
2009 Cell Communication and Signaling  
Deletions of the mitochondrial DNA (mtDNA) are thought to contribute to extrinsic skin aging, because they are found at increased amounts in photoaged skin and are induced through chronic UV irradiation  ...  These cells, which were matched for donor age, and passage number, were either derived from Kearns-Sayre syndrome (KSS) patients, which constitutively carry large amounts of the UV-inducible mitochondrial  ...  Deletions of the mitochondrial DNA (mtDNA) are thought to contribute to extrinsic skin aging, because they are found at increased amounts in photoaged skin and are induced through chronic UV irradiation  ... 
doi:10.1186/1478-811x-7-s1-a65 pmcid:PMC4291775 fatcat:7arcrefl2bgrfokpo4nqs6if24

Combinatorial problems on series-parallel graphs

K. Takamizawa, T. Nishizeki, N. Saito
1981 Discrete Applied Mathematics  
, in which one would like to decide whether an input graph satisfies Q; (ii) the minimum edge (vertex) deletion problem with respect to the same property as above; and (iii) the generalized matching problem  ...  problem); (2) the maximum (induced) line-subgraph problem: (3) the minimum edge (vertex) deletion problem with respect to property "without cycles (or paths) of specified length it or any length in";  ... 
doi:10.1016/0166-218x(81)90031-7 fatcat:rpm7tgtyvzhjvgdxs4uu7mkxm4

Functional Consequences of Mitochondrial DNA Deletions in Human Skin Fibroblasts

Marc Majora, Tanja Wittkampf, Bianca Schuermann, Maren Schneider, Susanne Franke, Susanne Grether-Beck, Ekkehard Wilichowski, Françoise Bernerd, Peter Schroeder, Jean Krutmann
2009 American Journal of Pathology  
Deletions of the mitochondrial DNA (mtDNA) are thought to contribute to extrinsic skin aging, because they are found at increased amounts in photoaged skin and are induced through chronic UV irradiation  ...  These cells, which were matched for donor age, and passage number, were either derived from Kearns-Sayre syndrome (KSS) patients, which constitutively carry large amounts of the UV-inducible mitochondrial  ...  Deletions of the mitochondrial DNA (mtDNA) are thought to contribute to extrinsic skin aging, because they are found at increased amounts in photoaged skin and are induced through chronic UV irradiation  ... 
doi:10.2353/ajpath.2009.080832 pmid:19661442 pmcid:PMC2731121 fatcat:kusfs6kq2fdvleb623fdomfr7q

43Matrix metalloproteinase-9 deletion shifts macrophage polarization towards M2 phenotype in aged left ventricles post-myocardial infarction

A Yabluchanskiy, Y Ma, K Deleon-Pennell, Y-F Jin, M Lindsey
2014 Cardiovascular Research  
Additionally, MMP-9 deletion resulted in the increase of CD163 in old mice post-MI compared to young null and age-matched WT control groups (all p,0.05; Figure 1 , B), suggesting enhanced M2 polarization  ...  We performed permanent occlusion of the left coronary descending artery to induce MI. Mice were sacrificed at day 7 post-MI, and macrophages were isolated from the infarcted area.  ...  Additionally, MMP-9 deletion resulted in the increase of CD163 in old mice post-MI compared to young null and age-matched WT control groups (all p,0.05; Figure 1 , B), suggesting enhanced M2 polarization  ... 
doi:10.1093/cvr/cvu079.3 fatcat:ntub7nsw5zekjoows3qvrdbz6i

CRISPRpic: fast and precise analysis for CRISPR-induced mutations via prefixed index counting

HoJoon Lee, Howard Y Chang, Seung Woo Cho, Hanlee P Ji
2020 NAR Genomics and Bioinformatics  
We developed a novel algorithm, named as CRISPRpic, to analyze the sequencing reads for the CRISPR experiments via counting exact-matching and pattern-searching.  ...  Analysis of CRISPR-induced mutations at targeted locus can be achieved by polymerase chain reaction amplification followed by parallel massive sequencing.  ...  ACKNOWLEDGEMENTS We thank to Stephanie Greer for her help in testing and depositing CRISPRpic to Github.  ... 
doi:10.1093/nargab/lqaa012 pmid:32118203 pmcid:PMC7034628 fatcat:v3s76g7hzfcmxj7z7p5mtm4t2q

Resilience and optimization of identifiable bipartite graphs

Epameinondas Fritzilas, Martin Milanič, Jérôme Monnot, Yasmin A. Rios-Solis
2013 Discrete Applied Mathematics  
A bipartite graph G = (L, R; E) with at least one edge is said to be identifiable if for every vertex v ∈ L, the subgraph induced by its non-neighbors has a matching of cardinality |L| − 1.  ...  Acknowledgements We are grateful to the two anonymous reviewers for their helpful comments.  ...  B j , y j is matched to a(x j ) and {z i1 , . . . , z it } are matched inside {d i1 , . . . , d it }.  ... 
doi:10.1016/j.dam.2012.01.005 fatcat:ktj3dhqjz5gjhazs4d2ajd7n34

CRISPRpic: Fast and precise analysis for CRISPR-induced mutations via prefixed index counting [article]

Seung Woo Cho, HoJoon Lee, Howard Y Chang, Hanlee P Ji
2018 bioRxiv   pre-print
We developed a novel algorithm, called CRISPRpic, to analyze sequencing reads from CRISPR experiments via counting exact-matches and pattern-searching.  ...  Analysis of CRISPR-induced mutations at targeted loci can be achieved by PCR amplification followed by massively parallel sequencing.  ...  Acknowledgements We thank to Stephanie Greer for her help in testing and depositing CRISPRpic to Github.  ... 
doi:10.1101/416768 fatcat:l2dttn2kcrb4zpbsppf6ngqwcq

Transcriptional regulation of an hsp70 heat shock gene in the yeast Saccharomyces cerevisiae

M R Slater, E A Craig
1987 Molecular and Cellular Biology  
Deletion of a proximal promoter region containing one element, HSE2, eliminated most of the heat-inducible expression of YG100.  ...  Progressive-deletion analysis suggested that sequences necessary for heat-inducible expression are more proximal, within 233 base pairs of the initiation region.  ...  to E.A.C.  ... 
doi:10.1128/mcb.7.5.1906 pmid:3037338 pmcid:PMC365295 fatcat:ugpvx6cbefalhatyyt3wrp6tqa
« Previous Showing results 1 — 15 out of 264,161 results