Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,217,328 papers from all fields of science
Search
Sign In
Create Free Account
String graph
Known as:
String
In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". Given a graph G, G is a string…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Bounded expansion
Circle packing theorem
Combinatorics, Probability and Computing
Complement graph
Expand
Broader (1)
Topological graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Simulating the DNA String Graph in Succinct Space
Diego Díaz-Domínguez
,
T. Gagie
,
G. Navarro
arXiv.org
2019
Corpus ID: 59336179
Converting a set of sequencing reads into a lossless compact data structure that encodes all the relevant biological information…
Expand
2019
2019
SOF: An Efficient String Graph Construction Algorithm
S. Morshed
,
Shibu Yooseph
IEEE International Conference on Bioinformatics…
2019
Corpus ID: 211061087
In contrast to genome assemblers that use de Bruijn graphs, those based on string graphs are able to losslessly retain…
Expand
2018
2018
On bounds on bend number of classes of split and cocomparability graphs
Dibyayan Chakraborty
,
Sandip Das
,
Joydeep Mukherjee
,
Uma Kant Sahoo
arXiv.org
2018
Corpus ID: 125149613
A \emph{$k$-bend path} is a rectilinear curve made up of $k + 1$ line segments. A \emph{$B_k$-VPG representation} of a graph is a…
Expand
2018
2018
Sequence Analysis HALS : Fast and High Throughput Algorithm for PacBio Long Read Self-Correction
Ergude Bao
,
Fei Xie
,
Chang-Jin Song
,
Dandan Song
2018
Corpus ID: 157059875
Motivation: The third generation PacBio long reads have greatly facilitated sequencing projects with very large read lengths, but…
Expand
2017
2017
Beyond-Planar Graphs : Algorithmics and Combinatorics
M. Kaufmann
,
S. Kobourov
2017
Corpus ID: 14187763
This report summarizes Dagstuhl Seminar 16452 “Beyond-Planar Graphs: Algorithmics and Combinatorics” and documents the talks and…
Expand
2014
2014
Constructing String Graphs in External Memory
P. Bonizzoni
,
G. D. Vedova
,
Yuri Pirola
,
M. Previtali
,
Raffaella Rizzi
Workshop on Algorithms in Bioinformatics
2014
Corpus ID: 1864132
In this paper we present an efficient external memory algorithm to compute the string graph from a collection of reads, which is…
Expand
2013
2013
Matching non-aligned objects using a relational string-graph
N. Dahm
,
Yongsheng Gao
,
T. Caelli
,
H. Bunke
IEEE International Conference on Image Processing
2013
Corpus ID: 17713371
Localising and aligning objects is a challenging task in computer vision that still remains largely unsolved. Utilising the…
Expand
2010
2010
The Growing Self-organizing Map for Clustering Algorithms in Programming Codes
G. Zhu
,
Xingyin Zhu
International Conference on Artificial…
2010
Corpus ID: 6177698
The growing self-organizing map (GSOM) is a variation of the popular self-organizing map (SOM). It was developed to address the…
Expand
2008
2008
Computational properties of spatial logics in the real plane
A. Griffiths
2008
Corpus ID: 8754912
6
2007
2007
QuanTree and QuanLin, Two Special Purpose Quantum Compilers
Robert R. Tucci
2007
Corpus ID: 11715810
Abstract This paper introduces QuanTree v1.1 and QuanLin v1.1, two Java applications avail-able for free. (Source code included…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE