---
_id: '11765'
abstract:
- lang: eng
text: This paper presents insertions-only algorithms for maintaining the exact and/or
approximate size of the minimum edge cut and the minimum vertex cut of a graph.
The algorithms output the approximate or exact sizekin timeO(1) and a cut of sizekin
time linear in its size. For the minimum edge cut problem and for any 0 < ε ≤
1, the amortized time per insertion isO(1/ε2) for a (2 + ε)-approximation,O((log
λ)((log n)/ε)2) for a (1 + ε)-approximation, andO(λ log n) for the exact size,
wherenis the number of nodes in the graph and λ is the size of the minimum cut.
The (2 + ε)-approximation algorithm and the exact algorithm are deterministic;
the (1 + ε)-approximation algorithm is randomized. We also present a static 2-approximation
algorithm for the size κ of the minimum vertex cut in a graph, which takes time.
This is a factor of κ faster than the best algorithm for computing the exact size,
which takes time. We give an insertions-only algorithm for maintaining a (2 +
ε)-approximation of the minimum vertex cut with amortized insertion timeO(n/ε).
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Henzinger MH. A static 2-approximation algorithm for vertex connectivity and
incremental approximation algorithms for edge and vertex connectivity. Journal
of Algorithms. 1997;24(1):194-220. doi:10.1006/jagm.1997.0855
apa: Henzinger, M. H. (1997). A static 2-approximation algorithm for vertex connectivity
and incremental approximation algorithms for edge and vertex connectivity. Journal
of Algorithms. Elsevier. https://doi.org/10.1006/jagm.1997.0855
chicago: Henzinger, Monika H. “A Static 2-Approximation Algorithm for Vertex Connectivity
and Incremental Approximation Algorithms for Edge and Vertex Connectivity.” Journal
of Algorithms. Elsevier, 1997. https://doi.org/10.1006/jagm.1997.0855.
ieee: M. H. Henzinger, “A static 2-approximation algorithm for vertex connectivity
and incremental approximation algorithms for edge and vertex connectivity,” Journal
of Algorithms, vol. 24, no. 1. Elsevier, pp. 194–220, 1997.
ista: Henzinger MH. 1997. A static 2-approximation algorithm for vertex connectivity
and incremental approximation algorithms for edge and vertex connectivity. Journal
of Algorithms. 24(1), 194–220.
mla: Henzinger, Monika H. “A Static 2-Approximation Algorithm for Vertex Connectivity
and Incremental Approximation Algorithms for Edge and Vertex Connectivity.” Journal
of Algorithms, vol. 24, no. 1, Elsevier, 1997, pp. 194–220, doi:10.1006/jagm.1997.0855.
short: M.H. Henzinger, Journal of Algorithms 24 (1997) 194–220.
date_created: 2022-08-08T12:18:38Z
date_published: 1997-07-01T00:00:00Z
date_updated: 2022-09-12T09:15:38Z
day: '01'
doi: 10.1006/jagm.1997.0855
extern: '1'
intvolume: ' 24'
issue: '1'
language:
- iso: eng
month: '07'
oa_version: None
page: 194-220
publication: Journal of Algorithms
publication_identifier:
issn:
- 0196-6774
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: A static 2-approximation algorithm for vertex connectivity and incremental
approximation algorithms for edge and vertex connectivity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '1997'
...
---
_id: '11767'
abstract:
- lang: eng
text: We give a linear-time algorithm for single-source shortest paths in planar
graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time
algorithm for maximum flow in a planar graph with the source and sink on the same
face. For the case where negative edge-lengths are allowed, we give an algorithm
requiringO(n4/3 log(nL)) time, whereLis the absolute value of the most negative
length. This algorithm can be used to obtain similar bounds for computing a feasible
flow in a planar network, for finding a perfect matching in a planar bipartite
graph, and for finding a maximum flow in a planar graph when the source and sink
are not on the same face. We also give parallel and dynamic versions of these
algorithms.
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Philip
full_name: Klein, Philip
last_name: Klein
- first_name: Satish
full_name: Rao, Satish
last_name: Rao
- first_name: Sairam
full_name: Subramanian, Sairam
last_name: Subramanian
citation:
ama: Henzinger MH, Klein P, Rao S, Subramanian S. Faster shortest-path algorithms
for planar graphs. Journal of Computer and System Sciences. 1997;55(1):3-23.
doi:10.1006/jcss.1997.1493
apa: Henzinger, M. H., Klein, P., Rao, S., & Subramanian, S. (1997). Faster
shortest-path algorithms for planar graphs. Journal of Computer and System
Sciences. Elsevier. https://doi.org/10.1006/jcss.1997.1493
chicago: Henzinger, Monika H, Philip Klein, Satish Rao, and Sairam Subramanian.
“Faster Shortest-Path Algorithms for Planar Graphs.” Journal of Computer and
System Sciences. Elsevier, 1997. https://doi.org/10.1006/jcss.1997.1493.
ieee: M. H. Henzinger, P. Klein, S. Rao, and S. Subramanian, “Faster shortest-path
algorithms for planar graphs,” Journal of Computer and System Sciences,
vol. 55, no. 1. Elsevier, pp. 3–23, 1997.
ista: Henzinger MH, Klein P, Rao S, Subramanian S. 1997. Faster shortest-path algorithms
for planar graphs. Journal of Computer and System Sciences. 55(1), 3–23.
mla: Henzinger, Monika H., et al. “Faster Shortest-Path Algorithms for Planar Graphs.”
Journal of Computer and System Sciences, vol. 55, no. 1, Elsevier, 1997,
pp. 3–23, doi:10.1006/jcss.1997.1493.
short: M.H. Henzinger, P. Klein, S. Rao, S. Subramanian, Journal of Computer and
System Sciences 55 (1997) 3–23.
date_created: 2022-08-08T12:28:45Z
date_published: 1997-08-01T00:00:00Z
date_updated: 2022-09-12T10:46:21Z
day: '01'
doi: 10.1006/jcss.1997.1493
extern: '1'
intvolume: ' 55'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1006/jcss.1997.1493
month: '08'
oa: 1
oa_version: Published Version
page: 3-23
publication: Journal of Computer and System Sciences
publication_identifier:
issn:
- 0022-0000
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster shortest-path algorithms for planar graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '1997'
...
---
_id: '11803'
abstract:
- lang: eng
text: We present the first fully dynamic algorithm for maintaining a minimum spanning
tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/3 log
n) amortized time per update operation. The algorithm is fairly simple and deterministic.
An immediate consequence is the first fully dynamic deterministic algorithm for
maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per
update, with O(1) worst case time per query.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Valerie
full_name: King, Valerie
last_name: King
citation:
ama: 'Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs.
In: 24th International Colloquium on Automata, Languages and Programming.
Vol 1256. Springer Nature; 1997:594–604. doi:10.1007/3-540-63165-8_214'
apa: 'Henzinger, M. H., & King, V. (1997). Maintaining minimum spanning trees
in dynamic graphs. In 24th International Colloquium on Automata, Languages
and Programming (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature.
https://doi.org/10.1007/3-540-63165-8_214'
chicago: Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees
in Dynamic Graphs.” In 24th International Colloquium on Automata, Languages
and Programming, 1256:594–604. Springer Nature, 1997. https://doi.org/10.1007/3-540-63165-8_214.
ieee: M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic
graphs,” in 24th International Colloquium on Automata, Languages and Programming,
Bologna, Italy, 1997, vol. 1256, pp. 594–604.
ista: 'Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic
graphs. 24th International Colloquium on Automata, Languages and Programming.
ICALP: International Colloquium on Automata, Languages, and Programming, LNCS,
vol. 1256, 594–604.'
mla: Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees
in Dynamic Graphs.” 24th International Colloquium on Automata, Languages and
Programming, vol. 1256, Springer Nature, 1997, pp. 594–604, doi:10.1007/3-540-63165-8_214.
short: M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata,
Languages and Programming, Springer Nature, 1997, pp. 594–604.
conference:
end_date: 1997-07-11
location: Bologna, Italy
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 1997-07-07
date_created: 2022-08-11T13:35:06Z
date_published: 1997-07-01T00:00:00Z
date_updated: 2023-02-14T07:49:03Z
day: '01'
doi: 10.1007/3-540-63165-8_214
extern: '1'
intvolume: ' 1256'
language:
- iso: eng
month: '07'
oa_version: None
page: 594–604
publication: 24th International Colloquium on Automata, Languages and Programming
publication_identifier:
eisbn:
- '9783540691945'
eissn:
- 1611-3349
isbn:
- '9783540631651'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maintaining minimum spanning trees in dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1256
year: '1997'
...
---
_id: '11849'
abstract:
- lang: eng
text: "This paper describes the DIGlTAL Continuous Profiling Infrastmcture, a sampling-based
profiling system designed to run continuously on production systems. The system
supports multiprocessors, works on unmodified executable& and collects profiles
for entire systems, including user programs, shared libraries, and the operating
system kernel. Samples are collected at a high rate (over 5200 samples/secper333-MHz
processor), yet with low overhead (l-3% slowdown for most workloads). Analysis
tools supplied with the profiling system use the sample data to produce an accurate
accounting, down to the level of pipeline stalls incurred by individual instructions,
of where time is being spent. When instructions incur stalls, the tools identify
possible reasons, such as cache misses, branch mispredictions, and functional
unit contention. The fine-grained instruction-level analysis guides users and
automated optimizers to the causes of performance\r\nproblems and provides important
insights for fixing them. "
article_processing_charge: No
article_type: original
author:
- first_name: Jennifer M.
full_name: Anderson, Jennifer M.
last_name: Anderson
- first_name: Lance M.
full_name: Berc, Lance M.
last_name: Berc
- first_name: Jeffrey
full_name: Dean, Jeffrey
last_name: Dean
- first_name: Sanjay
full_name: Ghemawat, Sanjay
last_name: Ghemawat
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Shun-Tak A.
full_name: Leung, Shun-Tak A.
last_name: Leung
- first_name: Richard L.
full_name: Sites, Richard L.
last_name: Sites
- first_name: Mark T.
full_name: Vandevoorde, Mark T.
last_name: Vandevoorde
- first_name: Carl A.
full_name: Waldspurger, Carl A.
last_name: Waldspurger
- first_name: William E.
full_name: Weihl, William E.
last_name: Weihl
citation:
ama: 'Anderson JM, Berc LM, Dean J, et al. Continuous profiling: Where have all
the cycles gone? ACM SIGOPS Operating Systems Review. 1997;31(5):1-14.
doi:10.1145/269005.266637'
apa: 'Anderson, J. M., Berc, L. M., Dean, J., Ghemawat, S., Henzinger, M. H., Leung,
S.-T. A., … Weihl, W. E. (1997). Continuous profiling: Where have all the cycles
gone? ACM SIGOPS Operating Systems Review. Association for Computing Machinery.
https://doi.org/10.1145/269005.266637'
chicago: 'Anderson, Jennifer M., Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika
H Henzinger, Shun-Tak A. Leung, Richard L. Sites, Mark T. Vandevoorde, Carl A.
Waldspurger, and William E. Weihl. “Continuous Profiling: Where Have All the Cycles
Gone?” ACM SIGOPS Operating Systems Review. Association for Computing Machinery,
1997. https://doi.org/10.1145/269005.266637.'
ieee: 'J. M. Anderson et al., “Continuous profiling: Where have all the cycles
gone?,” ACM SIGOPS Operating Systems Review, vol. 31, no. 5. Association
for Computing Machinery, pp. 1–14, 1997.'
ista: 'Anderson JM, Berc LM, Dean J, Ghemawat S, Henzinger MH, Leung S-TA, Sites
RL, Vandevoorde MT, Waldspurger CA, Weihl WE. 1997. Continuous profiling: Where
have all the cycles gone? ACM SIGOPS Operating Systems Review. 31(5), 1–14.'
mla: 'Anderson, Jennifer M., et al. “Continuous Profiling: Where Have All the Cycles
Gone?” ACM SIGOPS Operating Systems Review, vol. 31, no. 5, Association
for Computing Machinery, 1997, pp. 1–14, doi:10.1145/269005.266637.'
short: J.M. Anderson, L.M. Berc, J. Dean, S. Ghemawat, M.H. Henzinger, S.-T.A. Leung,
R.L. Sites, M.T. Vandevoorde, C.A. Waldspurger, W.E. Weihl, ACM SIGOPS Operating
Systems Review 31 (1997) 1–14.
date_created: 2022-08-16T07:07:03Z
date_published: 1997-12-01T00:00:00Z
date_updated: 2023-02-21T16:30:27Z
day: '01'
doi: 10.1145/269005.266637
extern: '1'
intvolume: ' 31'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/269005.266637
month: '12'
oa: 1
oa_version: Published Version
page: 1-14
publication: ACM SIGOPS Operating Systems Review
publication_identifier:
issn:
- 0163-5980
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '11849'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Continuous profiling: Where have all the cycles gone?'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '1997'
...
---
_id: '11883'
abstract:
- lang: eng
text: 'In dynamic graph algorithms the following provide-or-bound problem has to
be solved quickly: Given a set S containing a subset R and a way of generating
random elements from S testing for membership in R, either (i) provide an element
of R, or (ii) give a (small) upper bound on the size of R that holds with high
probability. We give an optimal algorithm for this problem. This algorithm improves
the time per operation for various dynamic graph algorithms by a factor of O(log n).
For example, it improves the time per update for fully dynamic connectivity from
O(log3n) to O(log2n).'
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Mikkel
full_name: Thorup, Mikkel
last_name: Thorup
citation:
ama: 'Henzinger MH, Thorup M. Sampling to provide or to bound: With applications
to fully dynamic graph algorithms. Random Structures and Algorithms. 1997;11(4):369-379.
doi:10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x'
apa: 'Henzinger, M. H., & Thorup, M. (1997). Sampling to provide or to bound:
With applications to fully dynamic graph algorithms. Random Structures and
Algorithms. Wiley. https://doi.org/10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x'
chicago: 'Henzinger, Monika H, and Mikkel Thorup. “Sampling to Provide or to Bound:
With Applications to Fully Dynamic Graph Algorithms.” Random Structures and
Algorithms. Wiley, 1997. https://doi.org/10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x.'
ieee: 'M. H. Henzinger and M. Thorup, “Sampling to provide or to bound: With applications
to fully dynamic graph algorithms,” Random Structures and Algorithms, vol.
11, no. 4. Wiley, pp. 369–379, 1997.'
ista: 'Henzinger MH, Thorup M. 1997. Sampling to provide or to bound: With applications
to fully dynamic graph algorithms. Random Structures and Algorithms. 11(4), 369–379.'
mla: 'Henzinger, Monika H., and Mikkel Thorup. “Sampling to Provide or to Bound:
With Applications to Fully Dynamic Graph Algorithms.” Random Structures and
Algorithms, vol. 11, no. 4, Wiley, 1997, pp. 369–79, doi:10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x.'
short: M.H. Henzinger, M. Thorup, Random Structures and Algorithms 11 (1997) 369–379.
date_created: 2022-08-17T07:21:55Z
date_published: 1997-12-07T00:00:00Z
date_updated: 2023-02-17T14:05:02Z
day: '07'
doi: 10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x
extern: '1'
intvolume: ' 11'
issue: '4'
language:
- iso: eng
month: '12'
oa_version: None
page: 369-379
publication: Random Structures and Algorithms
publication_identifier:
eissn:
- 1098-2418
issn:
- 1042-9832
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Sampling to provide or to bound: With applications to fully dynamic graph
algorithms'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '1997'
...
---
_id: '1942'
alternative_title:
- 'Photosynthesis: from light to biosphere'
author:
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: P
full_name: Burrows, P
last_name: Burrows
- first_name: P J
full_name: Nixon, P J
last_name: Nixon
citation:
ama: 'Sazanov LA, Burrows P, Nixon PJ. Presence of a large protein complex containing
the ndhK gene product and possessing NADH-specific dehydrogenase activity in thylakoid
membranes of higher plant chloroplasts. In: Vol 2. Kluwer; 1996:705-708.'
apa: 'Sazanov, L. A., Burrows, P., & Nixon, P. J. (1996). Presence of a large
protein complex containing the ndhK gene product and possessing NADH-specific
dehydrogenase activity in thylakoid membranes of higher plant chloroplasts (Vol.
2, pp. 705–708). Presented at the IPC: International Photosynthesis Congress,
Kluwer.'
chicago: Sazanov, Leonid A, P Burrows, and P J Nixon. “Presence of a Large Protein
Complex Containing the NdhK Gene Product and Possessing NADH-Specific Dehydrogenase
Activity in Thylakoid Membranes of Higher Plant Chloroplasts,” 2:705–8. Kluwer,
1996.
ieee: 'L. A. Sazanov, P. Burrows, and P. J. Nixon, “Presence of a large protein
complex containing the ndhK gene product and possessing NADH-specific dehydrogenase
activity in thylakoid membranes of higher plant chloroplasts,” presented at the
IPC: International Photosynthesis Congress, 1996, vol. 2, pp. 705–708.'
ista: 'Sazanov LA, Burrows P, Nixon PJ. 1996. Presence of a large protein complex
containing the ndhK gene product and possessing NADH-specific dehydrogenase activity
in thylakoid membranes of higher plant chloroplasts. IPC: International Photosynthesis
Congress, Photosynthesis: from light to biosphere, vol. 2, 705–708.'
mla: Sazanov, Leonid A., et al. Presence of a Large Protein Complex Containing
the NdhK Gene Product and Possessing NADH-Specific Dehydrogenase Activity in Thylakoid
Membranes of Higher Plant Chloroplasts. Vol. 2, Kluwer, 1996, pp. 705–08.
short: L.A. Sazanov, P. Burrows, P.J. Nixon, in:, Kluwer, 1996, pp. 705–708.
conference:
name: 'IPC: International Photosynthesis Congress'
date_created: 2018-12-11T11:54:50Z
date_published: 1996-01-01T00:00:00Z
date_updated: 2021-01-12T06:54:14Z
day: '01'
extern: 1
intvolume: ' 2'
month: '01'
page: 705 - 708
publication_status: published
publisher: Kluwer
publist_id: '5143'
quality_controlled: 0
status: public
title: Presence of a large protein complex containing the ndhK gene product and possessing
NADH-specific dehydrogenase activity in thylakoid membranes of higher plant chloroplasts
type: conference
volume: 2
year: '1996'
...
---
_id: '1951'
article_processing_charge: No
article_type: original
author:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Paul
full_name: Burrows, Paul
last_name: Burrows
- first_name: Peter
full_name: Nixon, Peter
last_name: Nixon
citation:
ama: Sazanov LA, Burrows P, Nixon P. Detection and characterization of a complex
I-like NADH-specific dehydrogenase from pea thylakoids. Biochemical Society
Transactions. 1996;24(3):739-743. doi:10.1042/bst0240739
apa: Sazanov, L. A., Burrows, P., & Nixon, P. (1996). Detection and characterization
of a complex I-like NADH-specific dehydrogenase from pea thylakoids. Biochemical
Society Transactions. Portland Press. https://doi.org/10.1042/bst0240739
chicago: Sazanov, Leonid A, Paul Burrows, and Peter Nixon. “Detection and Characterization
of a Complex I-like NADH-Specific Dehydrogenase from Pea Thylakoids.” Biochemical
Society Transactions. Portland Press, 1996. https://doi.org/10.1042/bst0240739.
ieee: L. A. Sazanov, P. Burrows, and P. Nixon, “Detection and characterization of
a complex I-like NADH-specific dehydrogenase from pea thylakoids,” Biochemical
Society Transactions, vol. 24, no. 3. Portland Press, pp. 739–743, 1996.
ista: Sazanov LA, Burrows P, Nixon P. 1996. Detection and characterization of a
complex I-like NADH-specific dehydrogenase from pea thylakoids. Biochemical Society
Transactions. 24(3), 739–743.
mla: Sazanov, Leonid A., et al. “Detection and Characterization of a Complex I-like
NADH-Specific Dehydrogenase from Pea Thylakoids.” Biochemical Society Transactions,
vol. 24, no. 3, Portland Press, 1996, pp. 739–43, doi:10.1042/bst0240739.
short: L.A. Sazanov, P. Burrows, P. Nixon, Biochemical Society Transactions 24 (1996)
739–743.
date_created: 2018-12-11T11:54:53Z
date_published: 1996-01-01T00:00:00Z
date_updated: 2022-08-16T08:25:02Z
day: '01'
doi: 10.1042/bst0240739
extern: '1'
external_id:
pmid:
- '8878837'
intvolume: ' 24'
issue: '3'
language:
- iso: eng
month: '01'
oa_version: None
page: 739 - 743
pmid: 1
publication: Biochemical Society Transactions
publication_identifier:
issn:
- 0300-5127
publication_status: published
publisher: Portland Press
publist_id: '5131'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Detection and characterization of a complex I-like NADH-specific dehydrogenase
from pea thylakoids
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 24
year: '1996'
...
---
_id: '1952'
abstract:
- lang: eng
text: Two strains of Rhodospirillum rubrum were constructed in which, by a gene
dosage effect, the transhydrogenase activity of isolated chromatophores was increased
7-10-fold and 15-20-fold, respectively. The H+/H- ratio (the ratio of protons
translocated per hydride ion equivalent transferred from NADPH to an NAD+ analogue,
acetyl pyridine adenine dinucleotide), determined by a spectroscopic technique,
was approximately 1.0 for chromatophores from the over-expressing strains, but
was only approximately 0.6 for wild-type chromatophores. Highly-coupled proteoliposomes
were prepared containing purified transhydrogenase from beef-heart mitochondria.
Using the same technique, the H+/H- ratio was close to 1.0 for these proteoliposomes.
It is suggested that the mechanistic H+/H- ratio is indeed unity, but that a low
ratio is obtained in wild-type chromatophores because of inhomogeneity in the
vesicle population.
acknowledgement: L.A.S. would like to thank the Wellcome Trust, and T.B., the Biotechnology
and Biological Sciences Research Council, for financial support. We are very grateful
to Nick Cotton for helpful advice.
article_processing_charge: No
article_type: original
author:
- first_name: Tania
full_name: Bizouarn, Tania
last_name: Bizouarn
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Sébastien
full_name: Aubourg, Sébastien
last_name: Aubourg
- first_name: Julie
full_name: Jackson, Julie
last_name: Jackson
citation:
ama: Bizouarn T, Sazanov LA, Aubourg S, Jackson J. Estimation of the H+/H- ratio
of the reaction catalysed by the nicotinamide nucleotide transhydrogenase in chromatophores
from over-expressing strains of Rhodospirillum rubrum and in liposomes inlaid
with the purified bovine enzyme. Biochimica et Biophysica Acta - Bioenergetics.
1996;1273(1):4-12. doi:10.1016/0005-2728(95)00125-5
apa: Bizouarn, T., Sazanov, L. A., Aubourg, S., & Jackson, J. (1996). Estimation
of the H+/H- ratio of the reaction catalysed by the nicotinamide nucleotide transhydrogenase
in chromatophores from over-expressing strains of Rhodospirillum rubrum and in
liposomes inlaid with the purified bovine enzyme. Biochimica et Biophysica
Acta - Bioenergetics. Elsevier. https://doi.org/10.1016/0005-2728(95)00125-5
chicago: Bizouarn, Tania, Leonid A Sazanov, Sébastien Aubourg, and Julie Jackson.
“Estimation of the H+/H- Ratio of the Reaction Catalysed by the Nicotinamide Nucleotide
Transhydrogenase in Chromatophores from over-Expressing Strains of Rhodospirillum
Rubrum and in Liposomes Inlaid with the Purified Bovine Enzyme.” Biochimica
et Biophysica Acta - Bioenergetics. Elsevier, 1996. https://doi.org/10.1016/0005-2728(95)00125-5.
ieee: T. Bizouarn, L. A. Sazanov, S. Aubourg, and J. Jackson, “Estimation of the
H+/H- ratio of the reaction catalysed by the nicotinamide nucleotide transhydrogenase
in chromatophores from over-expressing strains of Rhodospirillum rubrum and in
liposomes inlaid with the purified bovine enzyme,” Biochimica et Biophysica
Acta - Bioenergetics, vol. 1273, no. 1. Elsevier, pp. 4–12, 1996.
ista: Bizouarn T, Sazanov LA, Aubourg S, Jackson J. 1996. Estimation of the H+/H-
ratio of the reaction catalysed by the nicotinamide nucleotide transhydrogenase
in chromatophores from over-expressing strains of Rhodospirillum rubrum and in
liposomes inlaid with the purified bovine enzyme. Biochimica et Biophysica Acta
- Bioenergetics. 1273(1), 4–12.
mla: Bizouarn, Tania, et al. “Estimation of the H+/H- Ratio of the Reaction Catalysed
by the Nicotinamide Nucleotide Transhydrogenase in Chromatophores from over-Expressing
Strains of Rhodospirillum Rubrum and in Liposomes Inlaid with the Purified Bovine
Enzyme.” Biochimica et Biophysica Acta - Bioenergetics, vol. 1273, no.
1, Elsevier, 1996, pp. 4–12, doi:10.1016/0005-2728(95)00125-5.
short: T. Bizouarn, L.A. Sazanov, S. Aubourg, J. Jackson, Biochimica et Biophysica
Acta - Bioenergetics 1273 (1996) 4–12.
date_created: 2018-12-11T11:54:53Z
date_published: 1996-01-11T00:00:00Z
date_updated: 2022-08-16T12:35:22Z
day: '11'
doi: 10.1016/0005-2728(95)00125-5
extern: '1'
external_id:
pmid:
- '8573594 '
intvolume: ' 1273'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 4 - 12
pmid: 1
publication: Biochimica et Biophysica Acta - Bioenergetics
publication_identifier:
issn:
- 0005-2728
publication_status: published
publisher: Elsevier
publist_id: '5132'
quality_controlled: '1'
status: public
title: Estimation of the H+/H- ratio of the reaction catalysed by the nicotinamide
nucleotide transhydrogenase in chromatophores from over-expressing strains of Rhodospirillum
rubrum and in liposomes inlaid with the purified bovine enzyme
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1273
year: '1996'
...
---
_id: '6161'
abstract:
- lang: eng
text: 'The tra-1 gene is a terminal regulator of somatic sex in Caenorhabditis elegans:
high tra-1 activity elicits female development, low tra-1 activity elicits male
development. To investigate the function and evolution of tra- 1, we examined
the tra-1 gene from the closely related nematode C. briggsae. Ce-tra-1 and Cb-tra-1
are unusually divergent. Each gene generates two transcripts, but only one of
these is present in both species. This common transcript encodes TRA-1A, which
shows only 44% amino acid identity between the species, a figure much lower than
that for previously compared genes. A Cb-tra-1 transgene rescues many tissues
of tra-1(null) mutants of C. elegans but not the somatic gonad or germ line. This
transgene also causes nongonadal feminization of XO animals, indicating incorrect
sexual regulation. Alignment of Ce-TRA-1A and Cb-TRA-1A defined several conserved
regions likely to be important for tra-1 function. The phenotype differences between
Ce-tra- 1(null) mutants rescued by Cb-tra-1 transgenes and wild-type C. elegans
indicate significant divergence of regulatory regions. These molecular and functional
studies suggest that evolution of sex determination in nematodes is rapid and
genetically complex.'
author:
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
- first_name: J.
full_name: Hodgkin, J.
last_name: Hodgkin
citation:
ama: 'de Bono M, Hodgkin J. Evolution of sex determination in Caenorhabditis: Unusually
high divergence of tra-1 and its functional consequences. Genetics. 1996;144(2):587-595.'
apa: 'de Bono, M., & Hodgkin, J. (1996). Evolution of sex determination in Caenorhabditis:
Unusually high divergence of tra-1 and its functional consequences. Genetics.
Genetics Society of America.'
chicago: 'Bono, Mario de, and J. Hodgkin. “Evolution of Sex Determination in Caenorhabditis:
Unusually High Divergence of Tra-1 and Its Functional Consequences.” Genetics.
Genetics Society of America, 1996.'
ieee: 'M. de Bono and J. Hodgkin, “Evolution of sex determination in Caenorhabditis:
Unusually high divergence of tra-1 and its functional consequences,” Genetics,
vol. 144, no. 2. Genetics Society of America, pp. 587–595, 1996.'
ista: 'de Bono M, Hodgkin J. 1996. Evolution of sex determination in Caenorhabditis:
Unusually high divergence of tra-1 and its functional consequences. Genetics.
144(2), 587–595.'
mla: 'de Bono, Mario, and J. Hodgkin. “Evolution of Sex Determination in Caenorhabditis:
Unusually High Divergence of Tra-1 and Its Functional Consequences.” Genetics,
vol. 144, no. 2, Genetics Society of America, 1996, pp. 587–95.'
short: M. de Bono, J. Hodgkin, Genetics 144 (1996) 587–595.
date_created: 2019-03-21T11:50:37Z
date_published: 1996-10-01T00:00:00Z
date_updated: 2021-01-12T08:06:28Z
day: '01'
extern: '1'
external_id:
pmid:
- '8889522'
intvolume: ' 144'
issue: '2'
keyword:
- amino acid sequence
- article
- caenorhabditis elegans
- evolution
- genetic variability
- nonhuman
- priority journal
- sex determination
- Amino Acid Sequence
- Animals
- Animals
- Genetically Modified
- Base Sequence
- Caenorhabditis
- Caenorhabditis elegans
- Caenorhabditis elegans Proteins
- DNA
- Helminth
- DNA-Binding Proteins
- Evolution
- Molecular
- Female
- Helminth Proteins
- Membrane Proteins
- Molecular Sequence Data
- Mutagenesis
- RNA
- Messenger
- Sequence Homology
- Amino Acid
- Sex Determination (Analysis)
- Transcription Factors
- Transgenes
- Turner Syndrome
- Animalia
- Caenorhabditis
- Caenorhabditis briggsae
- Caenorhabditis elegans
- Nematoda
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1207552/
month: '10'
oa: 1
oa_version: Published Version
page: 587-595
pmid: 1
publication: Genetics
publication_identifier:
issn:
- '00166731'
publication_status: published
publisher: Genetics Society of America
quality_controlled: '1'
status: public
title: 'Evolution of sex determination in Caenorhabditis: Unusually high divergence
of tra-1 and its functional consequences'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 144
year: '1996'
...
---
_id: '3462'
article_processing_charge: No
article_type: original
author:
- first_name: Thorsten
full_name: Melcher, Thorsten
last_name: Melcher
- first_name: Jörg
full_name: Geiger, Jörg
last_name: Geiger
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Hannah
full_name: Monyer, Hannah
last_name: Monyer
citation:
ama: Melcher T, Geiger J, Jonas PM, Monyer H. Analysis of molecular determinants
in native AMPA receptors. Neurochemistry International. 1996;28(2):141-144.
doi:10.1016/0197-0186(95)00077-1
apa: Melcher, T., Geiger, J., Jonas, P. M., & Monyer, H. (1996). Analysis of
molecular determinants in native AMPA receptors. Neurochemistry International.
Elsevier. https://doi.org/10.1016/0197-0186(95)00077-1
chicago: Melcher, Thorsten, Jörg Geiger, Peter M Jonas, and Hannah Monyer. “Analysis
of Molecular Determinants in Native AMPA Receptors.” Neurochemistry International.
Elsevier, 1996. https://doi.org/10.1016/0197-0186(95)00077-1.
ieee: T. Melcher, J. Geiger, P. M. Jonas, and H. Monyer, “Analysis of molecular
determinants in native AMPA receptors,” Neurochemistry International, vol.
28, no. 2. Elsevier, pp. 141–144, 1996.
ista: Melcher T, Geiger J, Jonas PM, Monyer H. 1996. Analysis of molecular determinants
in native AMPA receptors. Neurochemistry International. 28(2), 141–144.
mla: Melcher, Thorsten, et al. “Analysis of Molecular Determinants in Native AMPA
Receptors.” Neurochemistry International, vol. 28, no. 2, Elsevier, 1996,
pp. 141–44, doi:10.1016/0197-0186(95)00077-1.
short: T. Melcher, J. Geiger, P.M. Jonas, H. Monyer, Neurochemistry International
28 (1996) 141–144.
date_created: 2018-12-11T12:03:27Z
date_published: 1996-02-01T00:00:00Z
date_updated: 2022-08-11T09:42:29Z
day: '01'
doi: 10.1016/0197-0186(95)00077-1
extern: '1'
external_id:
pmid:
- '8719701 '
intvolume: ' 28'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 141 - 144
pmid: 1
publication: Neurochemistry International
publication_identifier:
issn:
- 0197-0186
publication_status: published
publisher: Elsevier
publist_id: '2925'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analysis of molecular determinants in native AMPA receptors
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 28
year: '1996'
...
---
_id: '3553'
abstract:
- lang: eng
text: Virtual environments open up new opportunities and challenges for geometric
modeling systems. A general approach to geometric modeling suitable for the Cave
Automatic Virtual Environment is described. The approach is based on alpha complexes,
and some of its capabilities are demonstrated by applying it to the study of biomolecules.
acknowledgement: We thank Ernst Miicke and Michael Facello for their work on the Alpha
shape library, and Nataraj Akkiraju for his work on the surface triangulation library.
We thank NCSA for providing access to the CAVE.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ping
full_name: Fu, Ping
last_name: Fu
- first_name: Jiang
full_name: Quian, Jiang
last_name: Quian
citation:
ama: 'Edelsbrunner H, Fu P, Quian J. Geometric modeling in CAVE. In: Proceedings
of the ACM Symposium on Virtual Reality Software and Technology. ACM; 1996:35-41
and-193-194. doi:10.1145/3304181.3304190'
apa: 'Edelsbrunner, H., Fu, P., & Quian, J. (1996). Geometric modeling in CAVE.
In Proceedings of the ACM Symposium on Virtual Reality Software and Technology
(pp. 35-41 and-193–194). Hong Kong: ACM. https://doi.org/10.1145/3304181.3304190'
chicago: Edelsbrunner, Herbert, Ping Fu, and Jiang Quian. “Geometric Modeling in
CAVE.” In Proceedings of the ACM Symposium on Virtual Reality Software and
Technology, 35-41 and-193–94. ACM, 1996. https://doi.org/10.1145/3304181.3304190.
ieee: H. Edelsbrunner, P. Fu, and J. Quian, “Geometric modeling in CAVE,” in Proceedings
of the ACM Symposium on Virtual Reality Software and Technology, Hong Kong,
1996, pp. 35-41 and-193–194.
ista: 'Edelsbrunner H, Fu P, Quian J. 1996. Geometric modeling in CAVE. Proceedings
of the ACM Symposium on Virtual Reality Software and Technology. VRST: Symposium
on Virtual Reality Software and Technology, 35-41 and-193–194.'
mla: Edelsbrunner, Herbert, et al. “Geometric Modeling in CAVE.” Proceedings
of the ACM Symposium on Virtual Reality Software and Technology, ACM, 1996,
pp. 35-41 and-193–94, doi:10.1145/3304181.3304190.
short: H. Edelsbrunner, P. Fu, J. Quian, in:, Proceedings of the ACM Symposium on
Virtual Reality Software and Technology, ACM, 1996, pp. 35-41 and-193–194.
conference:
end_date: 1996-07-04
location: Hong Kong
name: 'VRST: Symposium on Virtual Reality Software and Technology'
start_date: 1996-07-01
date_created: 2018-12-11T12:03:56Z
date_published: 1996-07-01T00:00:00Z
date_updated: 2022-08-10T13:42:02Z
day: '01'
doi: 10.1145/3304181.3304190
extern: '1'
language:
- iso: eng
month: '07'
oa_version: None
page: 35-41 and - 193-194
publication: Proceedings of the ACM Symposium on Virtual Reality Software and Technology
publication_identifier:
isbn:
- '9780897918251'
publication_status: published
publisher: ACM
publist_id: '2832'
quality_controlled: '1'
status: public
title: Geometric modeling in CAVE
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1996'
...
---
_id: '3634'
abstract:
- lang: eng
text: The evolutionary processes responsible for adaptation and speciation on islands
differ in several ways from those on the mainland. Most attention has been given
to the random genetic drift that arises when a population is founded from just
a few colonizing genomes. Theoretical obstacles to 'founder effect speciation'
are discussed, together with recent proposals for avoiding them. It is argued
that although certain kinds of epistasis can facilitate the evolution of strong
reproductive isolation, this favours divergence by selection as much as by random
drift.
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: James
full_name: Mallet, James
last_name: Mallet
citation:
ama: Barton NH, Mallet J. Natural selection and random genetic drift as causes of
evolution on islands. Philosophical Transactions of the Royal Society of London
Series B, Biological Sciences. 1996;351(1341):785-795. doi:10.1098/rstb.1996.0073
apa: Barton, N. H., & Mallet, J. (1996). Natural selection and random genetic
drift as causes of evolution on islands. Philosophical Transactions of the
Royal Society of London. Series B, Biological Sciences. Royal Society of London.
https://doi.org/10.1098/rstb.1996.0073
chicago: Barton, Nicholas H, and James Mallet. “Natural Selection and Random Genetic
Drift as Causes of Evolution on Islands.” Philosophical Transactions of the
Royal Society of London. Series B, Biological Sciences. Royal Society of London,
1996. https://doi.org/10.1098/rstb.1996.0073.
ieee: N. H. Barton and J. Mallet, “Natural selection and random genetic drift as
causes of evolution on islands,” Philosophical Transactions of the Royal Society
of London. Series B, Biological Sciences, vol. 351, no. 1341. Royal Society
of London, pp. 785–795, 1996.
ista: Barton NH, Mallet J. 1996. Natural selection and random genetic drift as causes
of evolution on islands. Philosophical Transactions of the Royal Society of London.
Series B, Biological Sciences. 351(1341), 785–795.
mla: Barton, Nicholas H., and James Mallet. “Natural Selection and Random Genetic
Drift as Causes of Evolution on Islands.” Philosophical Transactions of the
Royal Society of London. Series B, Biological Sciences, vol. 351, no. 1341,
Royal Society of London, 1996, pp. 785–95, doi:10.1098/rstb.1996.0073.
short: N.H. Barton, J. Mallet, Philosophical Transactions of the Royal Society of
London. Series B, Biological Sciences 351 (1996) 785–795.
date_created: 2018-12-11T12:04:21Z
date_published: 1996-06-29T00:00:00Z
date_updated: 2022-08-10T12:57:10Z
day: '29'
doi: 10.1098/rstb.1996.0073
extern: '1'
external_id:
pmid:
- '8693020'
intvolume: ' 351'
issue: '1341'
language:
- iso: eng
month: '06'
oa_version: None
page: 785 - 795
pmid: 1
publication: Philosophical Transactions of the Royal Society of London. Series B,
Biological Sciences
publication_identifier:
issn:
- 0962-8436
publication_status: published
publisher: Royal Society of London
publist_id: '2749'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Natural selection and random genetic drift as causes of evolution on islands
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 351
year: '1996'
...
---
_id: '3635'
abstract:
- lang: eng
text: Experiments on Drosophila suggest that genetic recombination may result in
lowered fitness of progeny (a 'recombination load'). This has been interpreted
as evidence either for a direct effect of recombination on fitness, or for the
maintenance of linkage disequilibria by epistatic selection. Here we show that
such a recombination load is to be expected even if selection favours increased
genetic recombination. This is because of the fact that, although a modifier may
suffer an immediate loss of fitness if it increases recombination, it eventually
becomes associated with a higher additive genetic variance in fitness, which allows
a faster response to direction selection. This argument applies to mutation-selection
balance with synergistic epistasis, directional selection on quantitative traits,
and ectopic exchange among transposable elements. Further experiments are needed
to determine whether the selection against recombination due to the immediate
load is outweighed by the increased additive variance in fitness produced by recombination.
article_processing_charge: No
article_type: original
author:
- first_name: Brian
full_name: Charlesworth, Brian
last_name: Charlesworth
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Charlesworth B, Barton NH. Recombination load associated with selection for
increased recombination. Genetical Research. 1996;67(1):27-41. doi:10.1017/S0016672300033450
apa: Charlesworth, B., & Barton, N. H. (1996). Recombination load associated
with selection for increased recombination. Genetical Research. Cambridge
University Press. https://doi.org/10.1017/S0016672300033450
chicago: Charlesworth, Brian, and Nicholas H Barton. “Recombination Load Associated
with Selection for Increased Recombination.” Genetical Research. Cambridge
University Press, 1996. https://doi.org/10.1017/S0016672300033450.
ieee: B. Charlesworth and N. H. Barton, “Recombination load associated with selection
for increased recombination,” Genetical Research, vol. 67, no. 1. Cambridge
University Press, pp. 27–41, 1996.
ista: Charlesworth B, Barton NH. 1996. Recombination load associated with selection
for increased recombination. Genetical Research. 67(1), 27–41.
mla: Charlesworth, Brian, and Nicholas H. Barton. “Recombination Load Associated
with Selection for Increased Recombination.” Genetical Research, vol. 67,
no. 1, Cambridge University Press, 1996, pp. 27–41, doi:10.1017/S0016672300033450.
short: B. Charlesworth, N.H. Barton, Genetical Research 67 (1996) 27–41.
date_created: 2018-12-11T12:04:21Z
date_published: 1996-02-01T00:00:00Z
date_updated: 2022-08-10T12:38:51Z
day: '01'
doi: 10.1017/S0016672300033450
extern: '1'
external_id:
pmid:
- '8919888 '
intvolume: ' 67'
issue: '1'
language:
- iso: eng
month: '02'
oa_version: None
page: 27 - 41
pmid: 1
publication: Genetical Research
publication_identifier:
issn:
- 0016-6723
publication_status: published
publisher: Cambridge University Press
publist_id: '2748'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recombination load associated with selection for increased recombination
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 67
year: '1996'
...
---
_id: '3756'
abstract:
- lang: eng
text: 'In many eukaryotic cells going through M-phase, a bipolar spindle is formed
by microtubules nucleated from centrosomes. These microtubules, in addition to
being `''captured” by kinetochores, may be stabilized by chromatin in two different
ways: short-range stabilization effects may affect microtubules in close contact
with the chromatin, while long-range stabilization effects may `''guide” microtubule
growth towards the chromatin (e.g., by introducing a diffusive gradient of an
enzymatic activity that affects microtubule assembly). Here, we use both meiotic
and mitotic extracts from Xenopus laevis eggs to study microtubule aster formation
and microtubule dynamics in the presence of chromatin. In `''low-speed” meiotic
extracts, in the presence of salmon sperm chromatin, we find that short-range
stabilization effects lead to a strong anisotropy of the microtubule asters. Analysis
of the dynamic parameters of microtubule growth shows that this anisotropy arises
from a decrease in the catastrophe frequency, an increase in the rescue frequency
and a decrease in the growth velocity. In this system we also find evidence for
long-range `''guidance” effects, which lead to a weak anisotropy of the asters.
Statistically relevant results on these long-range effects are obtained in `''high-speed”
mitotic extracts in the presence of artificially constructed chromatin stripes.
We find that aster anisotropy is biased in the direction of the chromatin and
that the catastrophe frequency is reduced in its vicinity. In this system we also
find a surprising dependence of the catastrophe and the rescue frequencies on
the length of microtubules nucleated from centrosomes: the catastrophe frequency
increases and the rescue frequency decreases with microtubule length.'
acknowledgement: "We would like to thank T. Holy and T. Mitchison for providing us
with centrosomes; M. Glotzer and T. Mitchison for giving us the plasmid for A90
cyclin B; J. Stock and members of his laboratory for help with biochemical preparations;
R. Zimmerman for help with the biotinylation of DNA; J. Shepard for help with the
patterning of surfaces; D. Tsui for use\r\nof his clean room facility, and D. Fygenson,
T. Holy, E. Karsenti, E. Kennedy, A. Levine, T. Mitchison, and G. Waters for valuable
discussions, constant encouragement and technical help. This work was partially
supported by the National Institutes of Health (Grant No. GM-50712) and the Human
Frontier Science Program."
article_processing_charge: No
article_type: original
author:
- first_name: Marileen
full_name: Dogterom, Marileen
last_name: Dogterom
- first_name: M.
full_name: Felix, M.
last_name: Felix
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Stanislas
full_name: Leibler, Stanislas
last_name: Leibler
citation:
ama: 'Dogterom M, Felix M, Guet CC, Leibler S. Influence of M-phase chromatin on
the anisotropy of microtubule asters. Journal of Cell Biology. 1996;133(1):125-140.
doi:doi: 10.1083/jcb.133.1.125
'
apa: 'Dogterom, M., Felix, M., Guet, C. C., & Leibler, S. (1996). Influence
of M-phase chromatin on the anisotropy of microtubule asters. Journal of Cell
Biology. Rockefeller University Press. https://doi.org/doi: 10.1083/jcb.133.1.125 '
chicago: 'Dogterom, Marileen, M. Felix, Calin C Guet, and Stanislas Leibler. “Influence
of M-Phase Chromatin on the Anisotropy of Microtubule Asters.” Journal of Cell
Biology. Rockefeller University Press, 1996. https://doi.org/doi: 10.1083/jcb.133.1.125 .'
ieee: M. Dogterom, M. Felix, C. C. Guet, and S. Leibler, “Influence of M-phase chromatin
on the anisotropy of microtubule asters,” Journal of Cell Biology, vol.
133, no. 1. Rockefeller University Press, pp. 125–140, 1996.
ista: Dogterom M, Felix M, Guet CC, Leibler S. 1996. Influence of M-phase chromatin
on the anisotropy of microtubule asters. Journal of Cell Biology. 133(1), 125–140.
mla: 'Dogterom, Marileen, et al. “Influence of M-Phase Chromatin on the Anisotropy
of Microtubule Asters.” Journal of Cell Biology, vol. 133, no. 1, Rockefeller
University Press, 1996, pp. 125–40, doi:doi: 10.1083/jcb.133.1.125 .'
short: M. Dogterom, M. Felix, C.C. Guet, S. Leibler, Journal of Cell Biology 133
(1996) 125–140.
date_created: 2018-12-11T12:05:00Z
date_published: 1996-01-01T00:00:00Z
date_updated: 2022-08-09T14:20:13Z
day: '01'
doi: 'doi: 10.1083/jcb.133.1.125 '
extern: '1'
external_id:
pmid:
- '8601601'
intvolume: ' 133'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2120784/
month: '01'
oa: 1
oa_version: Published Version
page: 125 - 140
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
issn:
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
publist_id: '2473'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Influence of M-phase chromatin on the anisotropy of microtubule asters
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 133
year: '1996'
...
---
_id: '4024'
abstract:
- lang: eng
text: We have developed general modeling software for a Cave Automatic Virtual Environment
(CAVE); one of its applications is modeling 3D protein structures, generating
both outside-in and inside-out views of geometric models. An advantage of the
CAVE over other virtual environments is that multiple viewers can observe the
same scene at the same time and place. Our software is scalable-from high-end
virtual environments such as the CAVE, to mid-range immersive desktop systems,
down to low-end graphics workstations. In the current configuration, a parallel
Silicon Graphics Power Challenge supercomputer architecture performs the computationally
intensive construction of surface patches remotely, and sends the results through
the I-WAY (Information Wide Area Year) using VBNS (Very-high-Bandwidth Network
Systems) to the graphics machines that drive the CAVE and our graphics visualization
software, Valvis (Virtual ALpha shapes VISualizer).
article_processing_charge: No
article_type: original
author:
- first_name: Nataraj
full_name: Akkiraju, Nataraj
last_name: Akkiraju
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ping
full_name: Fu, Ping
last_name: Fu
- first_name: Jiang
full_name: Qian, Jiang
last_name: Qian
citation:
ama: Akkiraju N, Edelsbrunner H, Fu P, Qian J. Viewing geometric protein structures
from inside a CAVE. IEEE Computer Graphics and Applications. 1996;16(4):58-61.
doi:10.1109/38.511855
apa: Akkiraju, N., Edelsbrunner, H., Fu, P., & Qian, J. (1996). Viewing geometric
protein structures from inside a CAVE. IEEE Computer Graphics and Applications.
IEEE. https://doi.org/10.1109/38.511855
chicago: Akkiraju, Nataraj, Herbert Edelsbrunner, Ping Fu, and Jiang Qian. “Viewing
Geometric Protein Structures from inside a CAVE.” IEEE Computer Graphics and
Applications. IEEE, 1996. https://doi.org/10.1109/38.511855.
ieee: N. Akkiraju, H. Edelsbrunner, P. Fu, and J. Qian, “Viewing geometric protein
structures from inside a CAVE,” IEEE Computer Graphics and Applications,
vol. 16, no. 4. IEEE, pp. 58–61, 1996.
ista: Akkiraju N, Edelsbrunner H, Fu P, Qian J. 1996. Viewing geometric protein
structures from inside a CAVE. IEEE Computer Graphics and Applications. 16(4),
58–61.
mla: Akkiraju, Nataraj, et al. “Viewing Geometric Protein Structures from inside
a CAVE.” IEEE Computer Graphics and Applications, vol. 16, no. 4, IEEE,
1996, pp. 58–61, doi:10.1109/38.511855.
short: N. Akkiraju, H. Edelsbrunner, P. Fu, J. Qian, IEEE Computer Graphics and
Applications 16 (1996) 58–61.
date_created: 2018-12-11T12:06:30Z
date_published: 1996-07-01T00:00:00Z
date_updated: 2022-08-09T13:32:21Z
day: '01'
doi: 10.1109/38.511855
extern: '1'
intvolume: ' 16'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
page: 58 - 61
publication: IEEE Computer Graphics and Applications
publication_identifier:
issn:
- 0018-9162
publication_status: published
publisher: IEEE
publist_id: '2101'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Viewing geometric protein structures from inside a CAVE
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 16
year: '1996'
...
---
_id: '4025'
abstract:
- lang: eng
text: Questions of chemical reactivity can often be cast as questions of molecular
geometry. Common geometric models for proteins and other molecules are the space-filling
diagram, the solvent accessible surface and the molecular surface. In this paper
we present a new approach to triangulating the surface of a molecule under the
three models, which is fast, robust, and results in topologically correct triangulations.
Our computations are based on a simplicial complex dual to the molecule models.
All proposed algorithms are parallelizable.
acknowledgement: 'The research of both authors is partially supported by the Office
of Naval Research. Herbert Edelsbrunner is also supported through the Alan T. Waterman
award, grant CCR-9118874. '
article_processing_charge: No
article_type: original
author:
- first_name: Nataraj
full_name: Akkiraju, Nataraj
last_name: Akkiraju
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Akkiraju N, Edelsbrunner H. Triangulating the surface of a molecule. Discrete
Applied Mathematics. 1996;71(1-3):5-22. doi:10.1016/S0166-218X(96)00054-6
apa: Akkiraju, N., & Edelsbrunner, H. (1996). Triangulating the surface of a
molecule. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/S0166-218X(96)00054-6
chicago: Akkiraju, Nataraj, and Herbert Edelsbrunner. “Triangulating the Surface
of a Molecule.” Discrete Applied Mathematics. Elsevier, 1996. https://doi.org/10.1016/S0166-218X(96)00054-6.
ieee: N. Akkiraju and H. Edelsbrunner, “Triangulating the surface of a molecule,”
Discrete Applied Mathematics, vol. 71, no. 1–3. Elsevier, pp. 5–22, 1996.
ista: Akkiraju N, Edelsbrunner H. 1996. Triangulating the surface of a molecule.
Discrete Applied Mathematics. 71(1–3), 5–22.
mla: Akkiraju, Nataraj, and Herbert Edelsbrunner. “Triangulating the Surface of
a Molecule.” Discrete Applied Mathematics, vol. 71, no. 1–3, Elsevier,
1996, pp. 5–22, doi:10.1016/S0166-218X(96)00054-6.
short: N. Akkiraju, H. Edelsbrunner, Discrete Applied Mathematics 71 (1996) 5–22.
date_created: 2018-12-11T12:06:30Z
date_published: 1996-12-05T00:00:00Z
date_updated: 2022-08-09T14:06:12Z
day: '05'
doi: 10.1016/S0166-218X(96)00054-6
extern: '1'
intvolume: ' 71'
issue: 1-3
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0166218X96000546?via%3Dihub
month: '12'
oa: 1
oa_version: Published Version
page: 5 - 22
publication: Discrete Applied Mathematics
publication_identifier:
issn:
- 0166-218X
publication_status: published
publisher: Elsevier
publist_id: '2102'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Triangulating the surface of a molecule
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 71
year: '1996'
...
---
_id: '4026'
abstract:
- lang: eng
text: A set of n weighted points in general position in R(d) defines a unique regular
triangulation. This paper proves that if the points are added one by one, then
flipping in a topological order will succeed in constructing this triangulation.
If, in addition, the points are added in a random sequence and the history of
the flips is used for locating the next point, then the algorithm takes expected
time at most O(n log n + n(inverted left perpendicular d/2 inverted right perpendicular)).
Under the assumption that the points and weights are independently and identically
distributed, the expected running time is between proportional to and a factor
log n more than the expected size of the regular triangulation. The expectation
is over choosing the points and over independent coin-flips performed by the algorithm.
acknowledgement: National Science Foundation under Grant CCR-8921421, Alan T. Waterman
award, Grant CCR-9118874.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Nimish
full_name: Shah, Nimish
last_name: Shah
citation:
ama: Edelsbrunner H, Shah N. Incremental topological flipping works for regular
triangulations. Algorithmica. 1996;15(3):223-241. doi:10.1007/BF01975867
apa: Edelsbrunner, H., & Shah, N. (1996). Incremental topological flipping works
for regular triangulations. Algorithmica. Springer. https://doi.org/10.1007/BF01975867
chicago: Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping
Works for Regular Triangulations.” Algorithmica. Springer, 1996. https://doi.org/10.1007/BF01975867.
ieee: H. Edelsbrunner and N. Shah, “Incremental topological flipping works for regular
triangulations,” Algorithmica, vol. 15, no. 3. Springer, pp. 223–241, 1996.
ista: Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular
triangulations. Algorithmica. 15(3), 223–241.
mla: Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping Works
for Regular Triangulations.” Algorithmica, vol. 15, no. 3, Springer, 1996,
pp. 223–41, doi:10.1007/BF01975867.
short: H. Edelsbrunner, N. Shah, Algorithmica 15 (1996) 223–241.
date_created: 2018-12-11T12:06:31Z
date_published: 1996-03-01T00:00:00Z
date_updated: 2022-08-09T09:46:07Z
day: '01'
doi: 10.1007/BF01975867
extern: '1'
intvolume: ' 15'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 223 - 241
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
publication_status: published
publisher: Springer
publist_id: '2099'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental topological flipping works for regular triangulations
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 15
year: '1996'
...
---
_id: '4027'
abstract:
- lang: eng
text: 'Questions about lines in space arise frequently as subproblems in three-dimensional
computational geometry. In this paper we study a number of fundamental combinatorial
and algorithmic problems involving arrangements of n lines in three-dimensional
space. Our main results include: 1. A tight Θ(n2) bound on the maximum combinatorial
description complexity of the set of all oriented lines that have specified orientations
relative to the n given lines. 2. A similar bound of Θ(n3) for the complexity
of the set of all lines passing above the n given lines. 3. A preprocessing procedure
using O(n2+ε) time and storage, for any ε > 0, that builds a structure supporting
O(logn)-time queries for testing if a line lies above all the given lines. 4.
An algorithm that tests the "towering property" in O(n4/3+ε) time, for
any ε > 0: do n given red lines lie all above n given blue lines? The tools
used to obtain these and other results include Plücker coordinates for lines in
space and ε-nets for various geometric range spaces.'
acknowledgement: Work on this paper by Bernard Chazelle has been supported by NSF
Grant CCR-87-00917. Work on this paper by Herbert Edelsbrunner has been supported
by NSF Grant CCR-87-14565. Work on this paper by Leonidas Guibas has been supported
by grants from the Mitsubishi and Toshiba Corporations. Work on this paper by Micha
Sharir has been supported by ONR Grant N00014-87-K-0129, by NSF Grants DCR-83-20085
and CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation,
the NCRD — the Israeli National Council for Research and Development, and the EMET
Fund of the Israeli Academy of Sciences.
article_processing_charge: No
article_type: original
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
- first_name: Jorge
full_name: Stolfi, Jorge
last_name: Stolfi
citation:
ama: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. Lines in space:
Combinatorics and algorithms. Algorithmica. 1996;15(5):428-447. doi:10.1007/BF01955043'
apa: 'Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Stolfi, J. (1996).
Lines in space: Combinatorics and algorithms. Algorithmica. Springer. https://doi.org/10.1007/BF01955043'
chicago: 'Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir,
and Jorge Stolfi. “Lines in Space: Combinatorics and Algorithms.” Algorithmica.
Springer, 1996. https://doi.org/10.1007/BF01955043.'
ieee: 'B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Stolfi, “Lines
in space: Combinatorics and algorithms,” Algorithmica, vol. 15, no. 5.
Springer, pp. 428–447, 1996.'
ista: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. 1996. Lines in
space: Combinatorics and algorithms. Algorithmica. 15(5), 428–447.'
mla: 'Chazelle, Bernard, et al. “Lines in Space: Combinatorics and Algorithms.”
Algorithmica, vol. 15, no. 5, Springer, 1996, pp. 428–47, doi:10.1007/BF01955043.'
short: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Stolfi, Algorithmica
15 (1996) 428–447.
date_created: 2018-12-11T12:06:31Z
date_published: 1996-05-01T00:00:00Z
date_updated: 2022-08-09T09:55:46Z
day: '01'
doi: 10.1007/BF01955043
extern: '1'
intvolume: ' 15'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
page: 428 - 447
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
publication_status: published
publisher: Springer
publist_id: '2100'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lines in space: Combinatorics and algorithms'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 15
year: '1996'
...
---
_id: '4030'
acknowledgement: article M-Pos412
article_processing_charge: No
author:
- first_name: Jie
full_name: Liang, Jie
last_name: Liang
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Shankar
full_name: Subramaniam, Shankar
last_name: Subramaniam
citation:
ama: Liang J, Edelsbrunner H, Subramaniam S. Effects of Molecular Shape Representations
on Boundary Element Method for Protein Electrostatics Computations. Vol 70.
Cell Press; 1996:A224-A224. doi:10.1016/S0006-3495(96)79664-9
apa: Liang, J., Edelsbrunner, H., & Subramaniam, S. (1996). Effects of molecular
shape representations on boundary element method for protein electrostatics computations.
Fortieth Annual Meeting (Vol. 70, pp. A224–A224). Cell Press. https://doi.org/10.1016/S0006-3495(96)79664-9
chicago: Liang, Jie, Herbert Edelsbrunner, and Shankar Subramaniam. Effects of
Molecular Shape Representations on Boundary Element Method for Protein Electrostatics
Computations. Fortieth Annual Meeting. Vol. 70. Cell Press, 1996. https://doi.org/10.1016/S0006-3495(96)79664-9.
ieee: J. Liang, H. Edelsbrunner, and S. Subramaniam, Effects of molecular shape
representations on boundary element method for protein electrostatics computations,
vol. 70, no. 2, Part 2. Cell Press, 1996, pp. A224–A224.
ista: Liang J, Edelsbrunner H, Subramaniam S. 1996. Effects of molecular shape representations
on boundary element method for protein electrostatics computations, Cell Press,p.
mla: Liang, Jie, et al. “Effects of Molecular Shape Representations on Boundary
Element Method for Protein Electrostatics Computations.” Fortieth Annual Meeting,
vol. 70, no. 2, Part 2, Cell Press, 1996, pp. A224–A224, doi:10.1016/S0006-3495(96)79664-9.
short: J. Liang, H. Edelsbrunner, S. Subramaniam, Effects of Molecular Shape Representations
on Boundary Element Method for Protein Electrostatics Computations, Cell Press,
1996.
date_created: 2018-12-11T12:06:32Z
date_published: 1996-02-19T00:00:00Z
date_updated: 2022-08-08T10:22:38Z
day: '19'
doi: 10.1016/S0006-3495(96)79664-9
extern: '1'
intvolume: ' 70'
issue: 2, Part 2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0006349596796649?via%3Dihub
month: '02'
oa: 1
oa_version: None
page: A224 - A224
publication: Fortieth Annual Meeting
publication_status: published
publisher: Cell Press
publist_id: '2097'
status: public
title: Effects of molecular shape representations on boundary element method for protein
electrostatics computations
type: conference_poster
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 70
year: '1996'
...
---
_id: '4031'
acknowledgement: article W-AM-L6
article_processing_charge: No
author:
- first_name: Jie
full_name: Liang, Jie
last_name: Liang
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Sudhakar
full_name: Pamidghantam, Sudhakar
last_name: Pamidghantam
- first_name: Shankar
full_name: Subramaniam, Shankar
last_name: Subramaniam
citation:
ama: 'Liang J, Edelsbrunner H, Pamidghantam S, Subramaniam S. Analytical Method
for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets. Vol 70.
Cell Press; 1996:A377-A377. doi:10.1016/S0006-3495(96)79670-4'
apa: 'Liang, J., Edelsbrunner, H., Pamidghantam, S., & Subramaniam, S. (1996).
Analytical method for molecular shapes: Area, volume, cavities, interface and
pockets. Fortieth Annual Meeting (Vol. 70, pp. A377–A377). Cell Press.
https://doi.org/10.1016/S0006-3495(96)79670-4'
chicago: 'Liang, Jie, Herbert Edelsbrunner, Sudhakar Pamidghantam, and Shankar Subramaniam.
Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and
Pockets. Fortieth Annual Meeting. Vol. 70. Cell Press, 1996. https://doi.org/10.1016/S0006-3495(96)79670-4.'
ieee: 'J. Liang, H. Edelsbrunner, S. Pamidghantam, and S. Subramaniam, Analytical
method for molecular shapes: Area, volume, cavities, interface and pockets,
vol. 70, no. 2, Part 2. Cell Press, 1996, pp. A377–A377.'
ista: 'Liang J, Edelsbrunner H, Pamidghantam S, Subramaniam S. 1996. Analytical
method for molecular shapes: Area, volume, cavities, interface and pockets, Cell
Press,p.'
mla: 'Liang, Jie, et al. “Analytical Method for Molecular Shapes: Area, Volume,
Cavities, Interface and Pockets.” Fortieth Annual Meeting, vol. 70, no.
2, Part 2, Cell Press, 1996, pp. A377–A377, doi:10.1016/S0006-3495(96)79670-4.'
short: 'J. Liang, H. Edelsbrunner, S. Pamidghantam, S. Subramaniam, Analytical Method
for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets, Cell Press,
1996.'
date_created: 2018-12-11T12:06:32Z
date_published: 1996-02-21T00:00:00Z
date_updated: 2022-08-08T10:21:56Z
day: '21'
doi: 10.1016/S0006-3495(96)79670-4
extern: '1'
intvolume: ' 70'
issue: 2, Part 2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0006349596796704?via%3Dihub
month: '02'
oa: 1
oa_version: None
page: A377 - A377
publication: Fortieth Annual Meeting
publication_status: published
publisher: Cell Press
publist_id: '2098'
status: public
title: 'Analytical method for molecular shapes: Area, volume, cavities, interface
and pockets'
type: conference_poster
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 70
year: '1996'
...