Two-pore domain K(+) channels (K2P) mediate background K(+) conductance and play a key role in a variety of cellular functions. Among the 15 mammalian K2P isoforms, TWIK-1, TASK-1, and TASK-3 K(+) channels are sensitive to extracellular acidification. Lowered or acidic extracellular pH (pH(o)) strongly inhibits outward currents through these K2P channels. However, the mechanism of how low pH(o)...

Two-pore domain (K2P) K(+) channels are major regulators of excitability that endow cells with an outwardly rectifying background "leak" conductance. In some K2P channels, strong voltage-dependent activation has been observed, but the mechanism remains unresolved because they lack a canonical voltage-sensing domain. Here, we show voltage-dependent gating is common to most K2P channels and that ...

There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...

Some of the following problems look similar to the MAD Triangulation problem, but we have not found any deep connections: •Minimum Average Distance Spanning Subgraph in a budgeted version [2] was studied in the context of network design (minimizing average routing time). The problem is NP-complete even with unit weights. •Minimum Average Distance Spanning Tree [1]. NP-completeness is implied by...

Potassium channels have become a focus in cancer biology as they play roles in cell behaviours associated with cancer progression, including proliferation, migration and apoptosis. Two-pore domain (K2P) potassium channels are background channels which enable the leak of potassium ions from cells. As these channels are open at rest they have a profound effect on cellular membrane potential and s...

A new constraint acquisition method for parwise-constrained data clustering based on user-feedback is proposed. The method searches for non-redundant intra-cluster and inter-cluster query-candidates, ranks the candidates by decreasing order of interest and, finally, prompts the user the most relevant query-candidates. A comparison between using the original data representation and using a learn...