コード例 #1
0
# Input: An integer k and a string Text.
# Output: DeBruijnk(Text).

# Sample Input:
#      4
#      AAGATTCTCTAC

# Sample Output:
#      AAG -> AGA
#      AGA -> GAT
#      ATT -> TTC
#      CTA -> TAC
#      CTC -> TCT
#      GAT -> ATT
#      TCT -> CTA,CTC
#      TTC -> TCT

import inout
import common

k = int(inout.infilelines[0].strip())
sequence = inout.infilelines[1].strip()

graph = common.debruijn_graph(common.all_kmers(sequence, k))

graph_strs = []
for k, v in graph.iteritems():
    graph_strs.append(common.debruijn_to_str(k, v))

inout.output('\n'.join(graph_strs))
コード例 #2
0
ファイル: Stepic-54-7.py プロジェクト: chungtseng/rosalind
# Input: A collection of k-mers Patterns.
# Output: The adjacency list of the de Bruijn graph DeBruijn(Patterns).

# Sample Input:
#      GAGG
#      GGGG
#      GGGA
#      CAGG
#      AGGG
#      GGAG

# Sample Output:
#      AGG -> GGG
#      CAG -> AGG
#      GAG -> AGG
#      GGA -> GAG
#      GGG -> GGA,GGG    
 
import inout
import common

sequences = map(str.strip, inout.infilelines)

graph = common.debruijn_graph(sequences)		

graph_strs = []
for k,v in graph.iteritems():
	graph_strs.append(common.debruijn_to_str(k,v))

inout.output('\n'.join(graph_strs))
コード例 #3
0
ファイル: Stepic-53-6.py プロジェクト: chungtseng/rosalind
# Input: An integer k and a string Text.
# Output: DeBruijnk(Text).

# Sample Input:
#      4
#      AAGATTCTCTAC

# Sample Output:
#      AAG -> AGA
#      AGA -> GAT
#      ATT -> TTC
#      CTA -> TAC
#      CTC -> TCT
#      GAT -> ATT
#      TCT -> CTA,CTC
#      TTC -> TCT
     
import inout
import common

k = int(inout.infilelines[0].strip())
sequence = inout.infilelines[1].strip()

graph = common.debruijn_graph(common.all_kmers(sequence, k))		

graph_strs = []
for k,v in graph.iteritems():
	graph_strs.append(common.debruijn_to_str(k,v))

inout.output('\n'.join(graph_strs))
コード例 #4
0
# Input: A collection of k-mers Patterns.
# Output: The adjacency list of the de Bruijn graph DeBruijn(Patterns).

# Sample Input:
#      GAGG
#      GGGG
#      GGGA
#      CAGG
#      AGGG
#      GGAG

# Sample Output:
#      AGG -> GGG
#      CAG -> AGG
#      GAG -> AGG
#      GGA -> GAG
#      GGG -> GGA,GGG

import inout
import common

sequences = map(str.strip, inout.infilelines)

graph = common.debruijn_graph(sequences)

graph_strs = []
for k, v in graph.iteritems():
    graph_strs.append(common.debruijn_to_str(k, v))

inout.output('\n'.join(graph_strs))